Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one
Exact dynamics of the critical Kauffman model with connectivity one

Single-input Boolean networks

    A new, simpler approach to the critical Kauffman model with connectivity one reveals that it has more attractors than previously believed.

    Exact dynamics of the critical Kauffman model with connectivity one

    Arxiv (2023)

    T. Fink

    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 prove that the number of attractors is at least 2m−o(m), where m is the number of nodes in loops—considerably larger than previously believed. We also find the mean attractor length is at most 2o(m), the first proof that it is sub-exponential in m.

    Arxiv (2023)

    T. Fink