Superpolynomial Growth in the Number of Attractors in Kauffman Networks
Top Cited Papers
- 4 March 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 90 (9) , 098701
- https://doi.org/10.1103/physrevlett.90.098701
Abstract
The Kauffman model describes a particularly simple class of random Boolean networks. Despite the simplicity of the model, it exhibits complex behavior and has been suggested as a model for real world network problems. We introduce a novel approach to analyzing attractors in random Boolean networks, and applying it to Kauffman networks we prove that the average number of attractors grows faster than any power law with system size.Keywords
This publication has 14 references indexed in Scilit:
- Metabolic stability and epigenesis in randomly constructed genetic netsPublished by Elsevier ,2004
- Effects of alternative connectivity on behavior of randomly constructed Boolean networksPhysica D: Nonlinear Phenomena, 2002
- Stability of the Kauffman modelPhysical Review E, 2001
- From topology to dynamics in biochemical networksChaos: An Interdisciplinary Journal of Nonlinear Science, 2001
- A numerical investigation of adaptation in populations of random boolean networksPhysica A: Statistical Mechanics and its Applications, 2001
- Neutral Mutations and Punctuated Equilibrium in Evolving Genetic NetworksPhysical Review Letters, 1998
- The modular structure of Kauffman networksPhysica D: Nonlinear Phenomena, 1998
- A Numerical Study of the Critical Line of Kauffman NetworksJournal of Theoretical Biology, 1997
- Counting and Classifying Attractors in High Dimensional Dynamical SystemsJournal of Theoretical Biology, 1996
- Power-Law Distributions in Some Random Boolean NetworksPhysical Review Letters, 1996