Superpolynomial growth in the number of attractors in Kauffman networks.

@article{Samuelsson2003SuperpolynomialGI,
  title={Superpolynomial growth in the number of attractors in Kauffman networks.},
  author={Bj{\"o}rn Samuelsson and Carl Troein},
  journal={Physical review letters},
  year={2003},
  volume={90 9},
  pages={098701}
}
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. 
Highly Cited
This paper has 210 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
93 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 93 extracted citations

210 Citations

0102030'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 210 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Physica (Amsterdam) 170D

  • C. Oosawa, M. A. Savageua
  • 143
  • 2002

Chaos 11

  • J. J. Fox, C. C. Hill
  • 809
  • 2001

Physica (Amsterdam) 301A

  • N. Lemke, J.C.M. Mombach, B.E.J. Bodmann
  • 589
  • 2001

Phys

  • S. Bornholdt, K. Sneppen
  • Rev. Lett. 81, 236
  • 1998

Physica (Amsterdam) 115D

  • U. Bastolla, G. Parisi
  • 219
  • 1998

Biol

  • R. J. Bagley, L. Glass, J. Theor
  • 183, 269
  • 1996

A 21

  • H. Flyvbjerg, J. Phys
  • L955
  • 1988
2 Excerpts

Europhys

  • B. Derrida, Y. Pomeau
  • Lett. 1, 45
  • 1986

Similar Papers

Loading similar papers…