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

A new, simple approach to the critical Kauffman model with connectivity one sharpens the bounds on the number and length of attractors.

A simple solution of the critical Kauffman model with connectivity one

Submitted (2023)

T. Fink, F. Sheldon

The Kauffman model is a simple model of genetic computation which highlights the importance of critical behavior at the border of order and chaos. We present a simple proof that the number and length of attractors for the critical Kauffman model with connectivity one exhibit super-polynomial growth with the size of the network, improving on the best known bounds. Our approach is to bound the mean attractor length from above and below using elementary methods in number theory.

Submitted (2023)

T. Fink, F. Sheldon