arXiv · cond-mat/0410546
On the properties of cycles of simple Boolean networks
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
V. Kaufman, B. Drossel. 2004-10-21. On the properties of cycles of simple Boolean networks. https://doi.org/10.1140/epjb%2Fe2005-00034-6
Cite the original work for its findings. Save a collection to share your selection of sources.