Number of attractors in random Boolean networks

Area of Science:

• Computational Biology
• Network Theory
• Dynamical Systems

Background:

• Kauffman networks are models of gene regulation.
• Previous work evaluated attractor numbers in specific network configurations.
• Understanding attractor dynamics is crucial for biological systems.

Purpose of the Study:

• To generalize attractor number evaluation in Kauffman networks.
• To extend the analysis to critical networks and networks with two inputs per node.
• To explore the impact of different update function probability distributions.

Main Methods:

• Generalization of existing mathematical frameworks for attractor counting.
• Analysis of network properties including frozen, nonfrozen, and relevant nodes.
• Development of a phenomenological argument connecting network structure to attractor dynamics.

Main Results:

• The evaluation of attractor numbers is extended to critical and two-input node networks.
• A link is established between calculation terms and graphical network concepts.
• The dependence of attractor numbers on system size is reproduced phenomenologically.

Conclusions:

• The generalized framework provides a deeper understanding of attractor dynamics in Boolean networks.
• Network topology and update function properties significantly influence attractor counts.
• The findings offer insights into the complexity and behavior of biological regulatory networks.