Number and length of attractors in a critical Kauffman model with connectivity one

Abstract

The Kauffman model describes a system of randomly connected nodes with dynamics based on Boolean update functions. Though it is a simple model, it exhibits very complex behavior for "critical" parameter values at the boundary between a frozen and a disordered phase, and is therefore used for studies of real network problems. We prove here that the mean number and mean length of attractors in critical random Boolean networks with connectivity one both increase faster than any power law with network size. We derive these results by generating the networks through a growth process and by calculating lower bounds.

4 pages, no figure, no table; published in PRL

Cited by in corpus (16)

• Outer-totalistic cellular automata on graphs
• Emergent Criticality from Co-evolution in Random Boolean Networks
• Canalization and Symmetry in Boolean Models for Genetic Regulatory Networks
• Scaling in a general class of critical random Boolean networks
• Noise in random Boolean networks
• Relevant components in critical random Boolean networks
• Broad edge of chaos in strongly heterogeneous Boolean networks
• Phase transition between synchronous and asynchronous updating algorithms
• The Kauffman model on Small-World Topology
• Complex Network Analysis of State Spaces for Random Boolean Networks
• The Number of Different Binary Functions Generated by NK-Kauffman Networks and the Emergence of Genetic Robustness
• Random sampling vs. exact enumeration of attractors in random Boolean networks
• Circuits, Attractors and Reachability in Mixed-K Kauffman Networks
• An Abstraction Theory for Qualitative Models of Biological Systems
• Avalanches, branching ratios, and clustering of attractors in Random Boolean Networks and in the segment polarity network of \emph{Drosophila}
• Random logic networks: from classical Boolean to quantum dynamics