• Go Mobile »
  • Access by Staats- und Universitaetsbibliothek Bremen

Superpolynomial Growth in the Number of Attractors in Kauffman Networks

Phys. Rev. Lett. 90, 098701 – Published 4 March 2003
Björn Samuelsson and Carl Troein

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.

DOI: http://dx.doi.org/10.1103/PhysRevLett.90.098701

  • Figure
  • Figure
  • Published 4 March 2003
  • Received 31 October 2002

Authors & Affiliations

Björn Samuelsson* and Carl Troein

  • Complex Systems Division, Department of Theoretical Physics, Lund University, Sölvegatan 14A, S-223 62 Lund, Sweden

  • *Electronic address: bjorn@thep.lu.se
  • Electronic address: carl@thep.lu.se

Article Text

Click to Expand

References

Click to Expand

Authorization Required


×
×

Images

2 of 2
×

Log In

Cancel
×

Search


Article Lookup
Paste a citation or DOI

Enter a citation
×

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 3.0 License. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

×