Basin entropy in Boolean network ensembles.

@article{Krawitz2007BasinEI,
  title={Basin entropy in Boolean network ensembles.},
  author={Peter M. Krawitz and Ilya Shmulevich},
  journal={Physical review letters},
  year={2007},
  volume={98 15},
  pages={
          158701
        }
}
The information processing capacity of a complex dynamical system is reflected in the partitioning of its state space into disjoint basins of attraction, with state trajectories in each basin flowing towards their corresponding attractor. We introduce a novel network parameter, the basin entropy, as a measure of the complexity of information that such a system is capable of storing. By studying ensembles of random Boolean networks, we find that the basin entropy scales with system size only in… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 42 CITATIONS

DNA Computing and Molecular Programming

  • Lecture Notes in Computer Science
  • 2013
VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Evolution of discrete gene regulatory models

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Dynamical Criticality: Overview and Open Questions

  • J. Systems Science & Complexity
  • 2015
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Evolutionary exploration of Boolean networks

  • 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
  • 2008
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED