Frustration and stability in random Boolean networks

DOI10.1016/0166-218X(84)90015-5MaRDI QIDQ795798zbMATH OpenWikidataFDO

Authors Françoise Fogelman-Soulié

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

stabilitylimit cyclesrandom Boolean networksdiscrete derivativeBoolean differential calculusDiscrete iterations of Boolean mappingsnon-frustrated circuitsstable core

Mathematics Subject Classification ID

General biology and biomathematics (92B05)

Recommendations

• On circuit functionality in Boolean networks
• Parallel and sequential computation on Boolean networks
• Negative local feedbacks in Boolean networks
• Fixed points of Boolean networks with small number of elementary circuits
• Limit cycles and update digraphs in Boolean networks

Cites work

• Boolean Differential Calculus and its Application to Switching Theory
• Control of switching nets
• Les dérivées partielles des fonctions pseudo-Booleennes généralisées
• Specific roles of the different Boolean mappings in random networks

Cited in

(5)

• The maximal coordination principle in regulatory Boolean networks
• Stochastic coupling of two random Boolean networks
• Parallel and sequential computation on Boolean networks
• Complexity and stable evolution of circuits
• Stable core and chaos control in random Boolean networks

This page was built for publication: Frustration and stability in random Boolean networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795798)