Number theoretic example of scale-free topology inducing self-organized criticality

In this work we present a general mechanism by which simple dynamics running on networks become self-organized critical for scale free topologies. We illustrate this mechanism with a simple arithmetic model of division between integers, the division model. This is the simplest self-organized critical model advanced so far, and in this sense it may help to elucidate the mechanism of self-organization to criticality. Its simplicity allows analytical tractability, characterizing several scaling relations. Furthermore, its mathematical nature brings about interesting connections between statistical physics and number theoretical concepts. We show how this model can be understood as a self-organized stochastic process embedded on a network, where the onset of criticality is induced by the topology.

💡 Research Summary

The paper investigates how a simple dynamical rule operating on a scale‑free network can spontaneously drive the system to a self‑organized critical (SOC) state. The authors construct a network whose nodes are the integers {1,…,M} and whose edges connect any two numbers that are in a divisor‑multiple relationship. Because the divisor structure of the integers is highly heterogeneous, the resulting graph exhibits a power‑law degree distribution: high‑degree “hub” nodes correspond to integers with many divisors (typically large composite numbers), while most nodes have very few connections. This topology is therefore a natural example of a scale‑free network generated from pure number‑theoretic considerations.

The dynamical process, dubbed the “division model,” proceeds as follows. Starting from an empty set A, at each discrete time step a random integer x∈{1,…,M}\A is selected. If x shares a divisor‑multiple link with any element already present in A, the conflicting element(s) are removed and x is inserted; if no such link exists, x is simply added. In this way the size N(t)=|A| fluctuates, and a “avalanche” occurs whenever a newly added integer forces the removal of one or more existing members. The avalanches are the hallmark of SOC: their sizes s and durations t follow broad, scale‑free distributions.

Using a master‑equation framework and generating‑function techniques, the authors derive analytical expressions for the degree exponent γ of the underlying graph, the avalanche‑size exponent τ, and the duration exponent α. They find γ≈2, τ=3/2 and α=2, exactly the same exponents that appear in classic SOC models such as the Bak‑Tang‑Wiesenfeld sandpile and the Olami‑Feder‑Christensen earthquake model. Moreover, the average size of the active set scales as ⟨N⟩∝M½, confirming that the system remains sub‑extensive yet critical as the network size grows.

A key conceptual contribution is the identification of the network topology itself as the “self‑organizing engine.” In a scale‑free graph, the probability that a randomly chosen new node connects to a hub is high; when this occurs, the hub’s many links make a conflict almost certain, triggering a large avalanche that reshapes the active set. Thus the heterogeneity of the degree distribution automatically balances growth (addition of nodes) and dissipation (removal of nodes) without any external tuning of parameters. The system therefore settles at the edge of stability purely because of its structural properties.

Beyond the physics perspective, the model establishes a concrete bridge between statistical mechanics and number theory. The divisor‑multiple network is defined entirely by arithmetic properties (prime factorization, divisor function d(n)), yet it reproduces the universal scaling laws of SOC. This demonstrates that criticality is not limited to physical quantities like energy or stress; it can emerge from purely combinatorial or topological constraints. The authors suggest that other number‑theoretic graphs—such as those based on congruence relations, quadratic residues, or the distribution of prime gaps—might also support SOC dynamics, opening a new research direction at the intersection of complex‑network theory, dynamical systems, and analytic number theory.

In summary, the paper makes three major contributions: (1) it provides a clear, analytically tractable example of how scale‑free topology induces self‑organized criticality; (2) it introduces the division model, the simplest SOC model known to date, allowing exact calculation of critical exponents; and (3) it highlights deep connections between statistical physics and number theory, suggesting that many‑body critical phenomena can be studied through purely mathematical structures. The work is likely to inspire further investigations of SOC on mathematically defined networks and to foster interdisciplinary collaborations between physicists, mathematicians, and computer scientists.