A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one
A simple solution of the critical Kauffman model with connectivity one

Landau meets Kauffman

Statistical physics

A simple solution of the critical Kauffman model with connectivity one

Submitted (2023)

T. Fink, F. Sheldon

A Kauffman network is a model of genetic computation that highlights the role of criticality at the border of order and chaos. But our limited theoretical understanding of it relies on convoluted arguments. We give a simple proof that the number of attractors for the critical model with connectivity one grows faster than previously believed. Our approach exploits a link between the critical dynamics and number theory.

Submitted (2023)

T. Fink, F. Sheldon