Scaling in ordered and critical random Boolean networks

Abstract

Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks lie at or near a critical point in parameter space that divides ``ordered'' from ``chaotic'' attractor dynamics. In the ordered regime, we show rigorously that the average number of relevant nodes (the ones that determine the attractor dynamics) remains constant with increasing system size N. For critical networks, our analysis and numerical results show that the number of relevant nodes scales like N^{1/3}. Numerical experiments also show that the median number of attractors in critical networks grows faster than linearly with N. The calculations explain why the correct asymptotic scaling is observed only for very large N.

4 pages, 3 figures; (Re)submitted to Physical Review Letters

References in corpus (3)

• Random graphs with arbitrary degree distributions and their applications
• Stability of the Kauffman Model
• Relevant elments, Magnetization and Dynamical Properties in Kauffman Networks: a Numerical Study

Cited by in corpus (36)

• The structure and function of complex networks
• Adaptive Coevolutionary Networks: A Review
• Number and length of attractors in a critical Kauffman model with connectivity one
• An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
• Coarse--graining, fixed points, and scaling in a large population of neurons
• The dynamics of critical Kauffman networks under asynchronous stochastic update
• On the number of attractors in random Boolean networks
• Scaling in critical random Boolean networks
• Emergent Criticality from Co-evolution in Random Boolean Networks
• Canalization and Symmetry in Boolean Models for Genetic Regulatory Networks
• Latent dynamical variables produce signatures of spatiotemporal criticality in large biological systems
• Scaling in a general class of critical random Boolean networks
• Exhaustive percolation on random networks
• The properties of attractors of canalyzing random Boolean networks
• Entropy of complex relevant components of Boolean networks
• Critical Kauffman networks under deterministic asynchronous update
• On the properties of cycles of simple Boolean networks
• Impact of individual nodes in Boolean network dynamics
• Kauffman networks with threshold functions
• Relevant components in critical random Boolean networks
• Optimal Stabilization of Boolean Networks through Collective Influence
• Random maps and attractors in random Boolean networks
• The computational complexity of Kauffman nets and the P versus NP problem
• Spike-Phase Coupling As an Order Parameter in a Leaky Integrate-and-Fire Model
• The Number of Different Binary Functions Generated by NK-Kauffman Networks and the Emergence of Genetic Robustness
• Symmetry in Critical Random Boolean Network Dynamics
• Compensatory interactions to stabilize multiple steady states or mitigate the effects of multiple deregulations in biological networks
• Formation of the frozen core in critical Boolean Networks
• Circuits, Attractors and Reachability in Mixed-K Kauffman Networks
• Feedback topology and XOR-dynamics in Boolean networks with varying input structure
• Scaling laws in critical random Boolean networks with general in- and out-degree distributions
• Avalanches, branching ratios, and clustering of attractors in Random Boolean Networks and in the segment polarity network of \emph{Drosophila}
• The large-scale logico-chemical structure of a transcriptional regulation network
• Dynamical regimes in non-ergodic random Boolean networks
• Random logic networks: from classical Boolean to quantum dynamics
• Periodic attractors of random truncator maps