Dynamical Instability in Boolean Networks as a Percolation Problem
arXiv:1201.1595 · doi:10.1103/PhysRevLett.109.085701
Abstract
Boolean networks, widely used to model gene regulation, exhibit a phase transition between regimes in which small perturbations either die out or grow exponentially. We show and numerically verify that this phase transition in the dynamics can be mapped onto a static percolation problem which predicts the long-time average Hamming distance between perturbed and unperturbed orbits.
References in corpus (12)
- Random graphs with arbitrary degree distributions and their applications
- Specificity and stability in topology of protein networks
- Network robustness and fragility: Percolation on random graphs
- Random Boolean Network Models and the Yeast Transcriptional Network
- The unreasonable effectiveness of tree-based theory for networks with clustering
- The effect of network topology on the stability of discrete state models of genetic control
- Closing probabilities in the Kauffman model: an annealed computation
- Weighted percolation on directed networks
- Scaling in a general class of critical random Boolean networks
- Exhaustive percolation on random networks
- Influence and Dynamic Behavior in Random Boolean Networks
- Dynamics of Boolean networks - an exact solution
Cited by in corpus (7)
- Controllability transition and nonlocality in network control
- Efficient immunization strategies to prevent financial contagion
- Stability of Boolean networks: The joint effects of topology and update rules
- Social Climber attachment in forming networks produces phase transition in a measure of connectivity
- Emergence of coexisting percolating clusters in networks
- Characterizing short-term stability for Boolean networks over any distribution of transfer functions
- Interplay between degree and Boolean rules in the stability of Boolean networks