The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Profile picture. Photo.

Carl Troein

Researcher

Profile picture. Photo.

Superpolynomial growth in the number of attractors in Kauffman networks

Author

  • Björn Samuelsson
  • Carl Troein

Summary, in English

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.

Department/s

  • Computational Biology and Biological Physics - Undergoing reorganization
  • Functional zoology

Publishing year

2003

Language

English

Publication/Series

Physical Review Letters

Volume

90

Issue

9

Document type

Journal article

Publisher

American Physical Society

Topic

  • Biophysics
  • Zoology

Status

Published

ISBN/ISSN/Other

  • ISSN: 1079-7114