Year: 2024
Type: article
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 show that the model is equivalent to a deceptively simple algebraic system of polynomials which count the number and length of cycles. The polynomial for multiple loops is the product of the polynomials for individual loops. Using this perspective, we prove that the number of cycles scales as 2 m , where m is the number of nodes in loops—as fast as possible and faster than previously believed. Published by the American Physical Society 2024
Source: Physical Review Research
Author: T. M. A. Fink
Language: English
Subfield: Condensed Matter Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,625
OpenAlex ID: W4405799540