Related Experiment Video
Updated: Sep 26, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
Published on: December 7, 2021
Superpolynomial growth in the number of attractors in Kauffman networks
Björn Samuelsson1, Carl Troein
1Complex Systems Division, Department of Theoretical Physics, Lund University, Sölvegatan 14A, S-223 62 Lund, Sweden. bjorn@thep.lu.se
Abstract:
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.
Related Concept Videos
Population Growth
Exponential Equations for Modeling Growth
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Modeling with Differential Equations
Current Growth And Decay In RL Circuits
Exponential Growth

