Relevant components in critical random Boolean networks

Abstract

Random Boolean networks were introduced in 1969 by Kauffman as a model for gene regulation. By combining analytical arguments and efficient numerical simulations, we evaluate the properties of relevant components of critical random Boolean networks independently of update scheme. As known from previous work, the number of relevant components grows logarithmically with network size. We find that in most networks all relevant nodes with more than one relevant input sit in the same component, while all other relevant components are simple loops. As the proportion of nonfrozen nodes with two relevant inputs increases, the number of relevant components decreases and the size and complexity of the largest complex component grows. We evaluate the probability distribution of different types of complex components in an ensemble of networks and confirm that it becomes independent of network size in the limit of large network size. In this limit, we determine analytically the frequencies of occurence of complex components with different topologies.

9 pages, 6 figures

References in corpus (14)

• The Yeast Cell-Cycle Network Is Robustly Designed
• Random Boolean Network Models and the Yeast Transcriptional Network
• Number and length of attractors in a critical Kauffman model with connectivity one
• Topology of biological networks and reliability of information processing
• Scaling in ordered and critical random Boolean networks
• Stable and unstable attractors in Boolean networks
• Stability of the Kauffman Model
• The dynamics of critical Kauffman networks under asynchronous stochastic update
• Canalizing Kauffman networks: non-ergodicity and its effect on their critical behavior
• On the number of attractors in random Boolean networks
• Scaling in critical random Boolean networks
• The properties of attractors of canalyzing random Boolean networks
• On the properties of cycles of simple Boolean networks
• Random maps and attractors in random Boolean networks

Cited by in corpus (5)

• Entropy of complex relevant components of Boolean networks
• Symmetry in Critical Random Boolean Network Dynamics
• 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}