Scaling in a general class of critical random Boolean networks

Area of Science:

• Complex systems
• Theoretical biology
• Network science

Background:

• Kauffman networks are models of gene regulatory networks.
• Understanding their behavior at critical states is crucial for biological insights.
• Previous studies often focused on specific network parameters.

Purpose of the Study:

• To analytically derive the scaling laws for nonfrozen and relevant nodes in critical Kauffman networks.
• To characterize the structure of the frozen core and relevant components.
• To understand the implications for attractor properties in large networks.

Main Methods:

• Analytical derivation of scaling behavior in the thermodynamic limit.
• Definition and analysis of a stochastic process for the frozen core.
• Mathematical analysis of node properties based on input number.

Main Results:

• The mean number of nonfrozen nodes scales as N^2/3 for networks with >1 input per node.
• A finite number of nonfrozen nodes have more than two nonfrozen inputs.
• The mean number of relevant nodes scales as N^1/3, with a finite number having two relevant inputs.

Conclusions:

• Relevant components in large critical Kauffman networks are predominantly simple loops.
• The mean number and length of attractors increase faster than any power law with network size.
• These findings provide a theoretical framework for understanding the complexity and dynamics of biological networks.