Exact dynamics of the critical Kauffman model with connectivity one

2023/02/10 by Fink, T. M. A.
#FOS: Biological sciences #FOS: Physical sciences #Molecular Networks (q-bio.MN) #Statistical Mechanics (cond-mat.stat-mech)

paper · doi:10.48550/arxiv.2302.05314

Abstract

The critical Kauffman model with connectivity one is the simplest class of critical Boolean networks. Nevertheless, it exhibits intricate behavior at the boundary of order and chaos. We introduce a formalism for expressing the dynamics of multiple loops as a product of the dynamics of individual loops. Using it, we prove that the number of attractors scales as 2^m, where m is the number of nodes in loops - as fast as possible, and much faster than previously believed.

Related

• Number and Length of Attractors in a Critical Kauffman Model with Connectivity One
• The Number of Attractors in Kauffman Networks
• Number of attractors in the critical Kauffman model is exponential
• Insights from number theory into the critical Kauffman model with connectivity one
• Circuits, Attractors and Reachability in Mixed-K Kauffman Networks