arxiv: 2605.06887 · v1 · submitted 2026-05-07 · 🧮 math.PR

Recognition: no theorem link

Law of large numbers for activated random walk on villages

Bal\'azs R\'ath, Jacob Richey, Mikl\'os Sal\'anki

Pith reviewed 2026-05-11 00:47 UTC · model grok-4.3

classification 🧮 math.PR

keywords activated random walklaw of large numbersvillage modelodometersubcriticalityself-organized criticalityinteracting particle system

0 comments

The pith

Under subcritical initial conditions, the stable configuration and odometer of activated random walk on villages converge as n goes to infinity to limits given by nonlinear equations.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper considers activated random walk in a village model where each site on a graph has n replicas. It proves that as n becomes large, the final number of particles at each village and the total jumps performed converge to deterministic values. These values solve a unique system of nonlinear equations derived from the mean-field approximation. This holds when the initial setup is subcritical and transitions lose some mass. Readers care because it gives an exact asymptotic for a self-organized criticality model on graphs, allowing prediction of large-scale behavior without full simulation.

Core claim

We prove a law of large numbers as n goes to infinity for the resulting stable configuration of particles and the odometer of the process, to a limit which is uniquely characterized by a system of non-linear equations, under a subcriticality assumption on the initial state for the village model of activated random walk with strictly sub-stochastic transitions on a finite graph.

What carries the argument

The village model (VARW) of activated random walk, where vertices are expanded to n replicas, with convergence driven by averaging over replicas to mean-field nonlinear equations for the stable state and odometer.

If this is right

The limiting stable configuration balances the initial particles with those that remain after accounting for losses in sub-stochastic walks.
The odometer limit quantifies the total activity needed to reach stabilization in the large-n regime.
The uniqueness of the solution to the nonlinear system ensures a single deterministic prediction for the asymptotics.
The result applies to any finite underlying graph, preserving its structure in the limit.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

If the nonlinear equations can be solved explicitly in special cases, they could provide closed-form predictions for stabilization thresholds.
The village construction might be adapted to study other particle systems like sandpiles or chip-firing on graphs for similar LLN results.
Extending beyond finite graphs to infinite lattices could reveal phase transitions in the subcritical regime.

Load-bearing premise

The initial particle configuration must be subcritical, and particle transitions must be strictly sub-stochastic to ensure almost sure stabilization.

What would settle it

Observing that for a sequence of initial states approaching the critical threshold, the convergence of the stable configuration fails or the limiting equations have multiple solutions as n increases.

read the original abstract

We consider activated random walk (ARW), an interacting particle system and prototypical model of self-organized criticality in a setting which combines mean-field behavior with the geometry of an arbitrary graph, which we call the village model of ARW, or VARW for short. VARW is obtained from a fixed graph by replacing each vertex with a 'village' that consists of n replicas of that vertex. We focus on VARW where particles walk according to a strictly sub-stochastic transition kernel on a finite underlying graph, so mass is sometimes lost (which guarantees that the system eventually stabilizes almost surely). Under a subcriticality assumption on the initial state we prove a law of large numbers as n goes to infinity for the resulting stable configuration of particles and the odometer of the process, to a limit which is uniquely characterized by a system of non-linear equations.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The village model for ARW gives a clean LLN for the stable configuration and odometer to a unique nonlinear mean-field limit.

read the letter

The paper introduces the village model for activated random walk: take a fixed finite graph, replace each vertex by n replicas, and let particles move with a strictly sub-stochastic kernel. Under a subcriticality assumption on the initial densities, the empirical measures of the final particle counts and the odometer converge almost surely as n goes to infinity to the unique solution of a system of nonlinear equations obtained by passing the microscopic dynamics to the limit. This is the main new piece. The construction blends fixed graph geometry with mean-field scaling in a straightforward way, and the assumptions are stated explicitly enough to guarantee almost-sure stabilization with bounded total activity. The stress-test finds no internal inconsistency or unjustified step in the argument as described. The soft spots are limited. The result stays on a finite graph, so the geometry is frozen while the replica count grows; this is standard for mean-field limits but restricts how much spatial structure survives in the limit. The abstract alone does not let one inspect the tightness or uniqueness arguments, though the equations are presented as independent of the finite-n objects rather than fitted post hoc. Sub-stochasticity buys stabilization at the cost of mass loss, which may narrow the range of applications. This is for people working on interacting particle systems and self-organized criticality who want a hybrid mean-field-plus-graph setting. The claim is precise and the model is new enough that a serious referee should see it. I would send it to peer review.

Referee Report

0 major / 3 minor

Summary. The manuscript introduces the village model of activated random walk (VARW) on a finite graph, where each vertex is replaced by n independent replicas. Particles evolve according to a strictly sub-stochastic transition kernel (ensuring mass loss and a.s. stabilization). Under an explicit subcriticality assumption on the initial configuration, the authors prove an almost-sure law of large numbers: as n→∞ the empirical measures of the stabilized particle counts and the odometer converge to the unique solution of a closed system of nonlinear equations obtained by passing to the limit in the microscopic dynamics.

Significance. If the result holds, it supplies a rigorous mean-field limit for ARW that retains graph geometry while achieving explicit characterization via nonlinear fixed-point equations. This is valuable for self-organized criticality models, as the limit equations are independent of n and can be solved numerically or analytically in special cases. The sub-stochasticity and subcriticality assumptions are stated cleanly and guarantee stabilization with bounded total activity, which is essential for the LLN.

minor comments (3)

[§2.2] §2.2 (village construction): the notation for the n replicas and the lifted transition kernel is introduced without a small diagram or explicit indexing convention; this makes the subsequent empirical-measure statements harder to parse on first reading.
[§4] §4 (nonlinear system): the passage from the microscopic odometer equation to the limiting fixed-point system is sketched but the uniform integrability or tightness argument used to justify interchanging limit and nonlinearity is not highlighted; a short dedicated lemma would improve readability.
[Theorem 1.1] Theorem 1.1: the statement of the LLN is given in terms of weak convergence of empirical measures, but the topology (e.g., total-variation or weak) is not named explicitly in the theorem; this should be added for precision.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, including the summary of the VARW model, the significance for mean-field limits in self-organized criticality, and the recommendation of minor revision. No specific major comments were provided in the report, so we have no point-by-point rebuttals to address. We are happy to make any minor adjustments if further details are supplied.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The derivation establishes an LLN for the stabilized particle configuration and odometer under subcritical initial densities and strict sub-stochasticity on a finite graph. The limiting measures are characterized as the unique solution to an independent system of nonlinear fixed-point equations obtained by passing to the limit in the microscopic dynamics; this system is not defined in terms of the finite-n objects by construction. No self-definitional steps, fitted inputs renamed as predictions, load-bearing self-citations, or ansatz smuggling appear in the argument. The central claim remains independent of its inputs once the stabilization and convergence steps are granted.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the subcriticality assumption for the initial configuration and on the finite-graph strictly sub-stochastic kernel; these are domain assumptions rather than derived quantities.

axioms (2)

domain assumption Subcriticality assumption on the initial state
Stated explicitly as required for the law of large numbers to hold.
domain assumption Strictly sub-stochastic transition kernel on a finite graph
Ensures almost-sure stabilization and is part of the model definition.

pith-pipeline@v0.9.0 · 5448 in / 1218 out tokens · 66957 ms · 2026-05-11T00:47:46.505055+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

12 extracted references · 6 canonical work pages · 3 internal anchors

[1]

Granas, A., Dugundji, J.Fixed point theory.New York: Springer, (2003)

2003
[2]

T.: Activated random walks onZ d.Probability Surveys17(2020), 478–544

Rolla, L. T.: Activated random walks onZ d.Probability Surveys17(2020), 478–544

2020
[3]

Levine, L.; Silvestri, V.: Universality conjectures for activated random walk.Probability Sur- veys21(2024)

2024
[4]

Divisible sandpiles via random walks in random scenery

Bou-Rabee, A., Peres, Y., Sava-Huss, E.: Divisible sandpiles via random walks in random scenery. Preprint, arXiv:2604.13968(2026)

work page internal anchor Pith review Pith/arXiv arXiv 2026
[5]

T., Sidoravicius, V.: Activated Random Walkers: Facts, Conjectures and Challenges.J

Dickman, R., Rolla, L. T., Sidoravicius, V.: Activated Random Walkers: Facts, Conjectures and Challenges.J. Stat. Phys.138(2010), 126–142

2010
[6]

Preprint, arXiv:2512.17491(2025)

Faul, L., Richard, X., B´ etrisey, M., Mazza, C.: On the abelian structure of noncompetitive chemical reaction networks. Preprint, arXiv:2512.17491(2025)

work page arXiv 2025
[7]

The number of particles in activated random walk on the complete graph

J´ ar´ ai, A. A., M¨ onch, C., Taggi, L.: The number of particles in activated random walk on the complete graph. Preprint, arXiv:2304.10169(2023)

work page internal anchor Pith review Pith/arXiv arXiv 2023
[8]

Preprint, arXiv:2509.10616(2025)

Junge, M., Kaufman, H., Meisel, J.: Mean-field limit for activated random walk on the integer lattice. Preprint, arXiv:2509.10616(2025)

work page arXiv 2025
[9]

Scaling limit and density conjecture for activated random walk on the complete graph

Junge, M., Kaufman, H., Meisel, J.: Scaling limit and density conjecture for activated random walk on the complete graph. Preprint, arXiv:2604.04747(2026)

work page internal anchor Pith review Pith/arXiv arXiv 2026
[10]

Preprint, arXiv:2603.25606(2026)

Kaiser, R., Kl¨ otzer, M., Sava-Huss, E.: Stabilization of stochastic networks in Markovian environment. Preprint, arXiv:2603.25606(2026)

work page arXiv 2026
[11]

Levine, L., Peres, Y.: Strong spherical asymptotics for rotor-router aggregation and the divis- ible sandpile.Potential Analysis30(2009), 1–27

2009
[12]

E.: The divisible sandpile at critical density

Levine, L., Murugan, M., Peres, Y., Ugurcan, B. E.: The divisible sandpile at critical density. Annales Henri Poincar´ e17(2016), 1677–1711. Acknowledgements.The authors would like to thank the Erd˝ os Center for sponsoring the Activated Random Walk focused workshop in May, 2025 where this research was initiated. J.R. was partially supported by a Simons F...

2016