Random Boolean Networks

Random Boolean networks (RBNs) are computational models in which each node takes a binary state (on/off) and updates according to a Boolean rule (AND, OR, NOT, etc.) based on inputs from a fixed number of other randomly chosen nodes. Kauffman used RBNs in the late 1960s to test whether networks with no inherent design could exhibit organized behavior. The answer was yes: random networks spontaneously organized into stable cycles (attractors) whose number scaled as the square root of network size—a mathematical relationship independent of specific wiring or rules. This was order for free: self-organization arising from network topology alone. The finding reshaped evolutionary biology by showing that gene regulatory networks likely possess spontaneous order that selection refines rather than creates. Recent AI research has discovered that artificial neural networks perform optimally at the same edge-of-chaos connectivity regime Kauffman identified in RBNs fifty years ago.