Entropy of complex relevant components of Boolean networks
arXiv:0708.1538 · doi:10.1103/PhysRevE.76.036115
Abstract
Boolean network models of strongly connected modules are capable of capturing the high regulatory complexity of many biological gene regulatory circuits. We study numerically the previously introduced basin entropy, a parameter for the dynamical uncertainty or information storage capacity of a network as well as the average transient time in random relevant components as a function of their connectivity. We also demonstrate that basin entropy can be estimated from time-series data and is therefore also applicable to non-deterministic networks models.
8 pages, 6 figures
References in corpus (12)
- The Yeast Cell-Cycle Network Is Robustly Designed
- Random Boolean Network Models and the Yeast Transcriptional Network
- Scaling in ordered and critical random Boolean networks
- Relevant elments, Magnetization and Dynamical Properties in Kauffman Networks: a Numerical Study
- The dynamics of critical Kauffman networks under asynchronous stochastic update
- The Modular Structure of Kauffman Networks
- Scaling in critical random Boolean networks
- The number and probability of canalizing functions
- Scaling in a general class of critical random Boolean networks
- The properties of attractors of canalyzing random Boolean networks
- On the properties of cycles of simple Boolean networks
- Relevant components in critical random Boolean networks