Characterizing short-term stability for Boolean networks over any distribution of transfer functions
arXiv:1409.4360 · doi:10.1103/PhysRevE.94.012301
Abstract
We present a characterization of short-term stability of random Boolean networks under \emph{arbitrary} distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. It has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.
References in corpus (13)
- The Yeast Cell-Cycle Network Is Robustly Designed
- Random Boolean Network Models and the Yeast Transcriptional Network
- Boolean network model predicts cell cycle sequence of fission yeast
- Genetic networks with canalyzing Boolean rules are always stable
- Canalizing Kauffman networks: non-ergodicity and its effect on their critical behavior
- Noisy Random Boolean Formulae - a Statistical Physics Perspective
- Binary threshold networks as a natural null model for biological networks
- Dynamical Instability in Boolean Networks as a Percolation Problem
- Stability of Boolean networks: The joint effects of topology and update rules
- Computing with Noise - Phase Transitions in Boolean Formulas
- Influence and Dynamic Behavior in Random Boolean Networks
- Dynamics of Boolean networks - an exact solution
- Noncooperatively Optimized Tolerance: Decentralized Strategic Optimization in Complex Systems