The basis of easy controllability in Boolean networks
arXiv:2010.12075 · doi:10.1038/s41467-021-25533-3
Abstract
Effective control of biological systems can often be achieved through the control of a surprisingly small number of distinct variables. We bring clarity to such results using the formalism of Boolean dynamical networks, analyzing the effectiveness of external control in selecting a desired final state when that state is among the original attractors of the dynamics. Analyzing 49 existing biological network models, we find strong numerical evidence that the average number of nodes that must be forced scales logarithmically with the number of original attractors. This suggests that biological networks may be typically easy to control even when the number of interacting components is large. We provide a theoretical explanation of the scaling by separating controlling nodes into three types: those that act as inputs, those that distinguish among attractors, and any remaining nodes. We further identify characteristics of dynamics that can invalidate this scaling, and speculate about how this relates more broadly to non-biological systems.
arXiv comment44 pages, 17 figures, 2 table
References in corpus (8)
- The Yeast Cell-Cycle Network Is Robustly Designed
- Structure-based control of complex networks with nonlinear dynamics
- Cell fate reprogramming by control of intracellular network dynamics
- Stable and unstable attractors in Boolean networks
- Logic and connectivity jointly determine criticality in biological gene regulatory networks
- The dynamics of critical Kauffman networks under asynchronous stochastic update
- Relative Stability of Network States in Boolean Network Models of Gene Regulation in Development
- A unified formal framework for developmental andevolutionary change in gene regulatory network models