Exact behavior of the critical Kauffman model with connectivity one
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 a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2024-12-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/PhysRevResearch.6.043315 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|