Frustration and stability in random Boolean networks

DOI10.1016/0166-218X(84)90015-5zbMath0542.94022WikidataQ126338774 ScholiaQ126338774MaRDI QIDQ795798

Françoise Fogelman-Soulié

Publication date: 1984

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

zbMATH Keywords

stabilitylimit cyclesstable corerandom Boolean networksdiscrete derivativeBoolean differential calculusDiscrete iterations of Boolean mappingsnon-frustrated circuits

Mathematics Subject Classification ID

Related Items (3)

Parallel and sequential computation on Boolean networks ⋮ The maximal coordination principle in regulatory Boolean networks ⋮ Stochastic coupling of two random Boolean networks

Cites Work

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

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