Stability of the Kauffman Model

Abstract

Random Boolean networks, the Kauffman model, are revisited by means of a novel decimation algorithm, which reduces the networks to their dynamical cores. The average size of the removed part, the stable core, grows approximately linearly with N, the number of nodes in the original networks. We show that this can be understood as the percolation of the stability signal in the network. The stability of the dynamical core is investigated and it is shown that this core lacks the well known stability observed in full Kauffman networks. We conclude that, somewhat counter-intuitive, the remarkable stability of Kauffman networks is generated by the dynamics of the stable core. The decimation method is also used to simulate large critical Kauffman networks. For networks up to N=32 we perform full enumeration studies. Strong evidence is provided for that the number of limit cycles grows linearly with N. This result is in sharp contrast to the often cited $\sqrt{N}$ behavior.

12 pages, 4 figures

Cited by in corpus (30)

• Cell fate reprogramming by control of intracellular network dynamics
• Number and length of attractors in a critical Kauffman model with connectivity one
• Scaling in ordered and critical random Boolean networks
• An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
• Stable and unstable attractors in Boolean networks
• Classification of Random Boolean Networks
• The dynamics of critical Kauffman networks under asynchronous stochastic update
• Introduction to Random Boolean Networks
• Complex and Adaptive Dynamical Systems: A Primer
• On the number of attractors in random Boolean networks
• Canalization and Symmetry in Boolean Models for Genetic Regulatory Networks
• Exhaustive percolation on random networks
• The properties of attractors of canalyzing random Boolean networks
• Numerical and Theoretical Studies of Noise Effects in the Kauffman Model
• Critical Kauffman networks under deterministic asynchronous update
• On the properties of cycles of simple Boolean networks
• Relevant components in critical random Boolean networks
• Broad edge of chaos in strongly heterogeneous Boolean networks
• Random maps and attractors in random Boolean networks
• The Kauffman model on Small-World Topology
• The Strange Man in Random Networks of Automata
• Random sampling vs. exact enumeration of attractors in random Boolean networks
• More than two equally probable variants of signal in Kauffman networks as an important overlooked case, negative feedbacks allow life in chaos
• Symmetry in Critical Random Boolean Network Dynamics
• Circuits, Attractors and Reachability in Mixed-K Kauffman Networks
• Perfect cycles in the synchronous Heider dynamics in complete network
• Feedback topology and XOR-dynamics in Boolean networks with varying input structure
• A SAT-Based Algorithm for Computing Attractors in Synchronous Boolean Networks
• Kauffman cellular automata on quasicrystal topology
• Fixed-points in Random Boolean Networks: The impact of parallelism in the scale-free topology case