Abstract.
We study two types of simple Boolean networks, namely two loops with a cross-link and one loop with an additional internal link. Such networks occur as relevant components of critical K=2 Kauffman networks. We determine mostly analytically the numbers and lengths of cycles of these networks and find many of the features that have been observed in Kauffman networks. In particular, the mean number and length of cycles can diverge faster than any power law.
Similar content being viewed by others
References
S. Kauffman, J. Theor. Biol. 22, 437 (1969)
J. Socolar, S. Kauffman, Phys. Rev. Lett. 90, 068702 (2003)
S. Bilke, F. Sjunnesson, Phys. Rev. E 65, 016129 (2002)
U. Bastolla, G. Parisi, Physica D 115, 203 (1998a)
B. Samuelsson, C. Troein, Phys. Rev. Lett. 90, 098701 (2003)
U. Bastolla, G. Parisi, Physica D 115, 219 (1998)
H. Flyvbjerg, J. Phys. A 21, L955 (1988)
M. Aldana-Gonzalez, S. Coppersmith, L. Kadanoff, Perspectives and Problems in Nonlinear Science, edited by J.E. Marsden, E. Kaplan, K.R. Sreenivasan (Springer, Berlin) 2003, pp. 23–89
H. Flyvbjerg, N.J. Kjær, J. Physics A 21, 1695 (1988)
G. Marsaglia, Computer Science and Statistics: Proceedings of the Symposium on the Interface, 16th, Atlanta, Georgia (1984)
S. Harris, B. Sawhill, A. Wuensche, S. Kauffman, Complexity 7, 23 (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kaufman, V., Drossel, B. On the properties of cycles of simple Boolean networks. Eur. Phys. J. B 43, 115–124 (2005). https://doi.org/10.1140/epjb/e2005-00034-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1140/epjb/e2005-00034-6