pith. sign in

arxiv: 2304.10169 · v4 · submitted 2023-04-20 · 🧮 math.PR

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

Antal A. J\'arai , Christian M\"onch , Lorenzo Taggi This is my paper

Pith reviewed 2026-05-24 09:41 UTC · model grok-4.3

classification 🧮 math.PR
keywords activated random walkcomplete graphstationary distributionconcentrationself-organized criticalitysuper-martingales
0
0 comments X

The pith

Activated random walk on the complete graph concentrates its stationary particle count at ρ_c N + a √(N log N).

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

The paper defines a Markov chain on the complete graph that adds one active particle at a random vertex each step and runs the activated random walk dynamics until every particle sleeps, removing particles that hit a boundary vertex. It proves that the stationary distribution of the total particle number concentrates with high probability around ρ_c N + a √(N log N), where ρ_c = λ/(1+λ) and a = √λ/(1+λ) for sleeping rate λ, and that the deviations are at most o(√(N log N)). The mean-field structure of the complete graph allows the exact values of ρ_c and a to be computed, while super-martingale estimates on the particle count supply the concentration. A reader cares because the result gives an explicit description of the stationary state in this elementary model of self-organized criticality.

Core claim

We characterise the support of the stationary distribution of this Markov chain, showing that, with high probability, the number of particles concentrates around the value ρ_c N + a √(N log N) with fluctuations of order at most o(√(N log N)), where N is the number of vertices. Due to the mean-field nature of the model, we are able to determine precisely the critical density ρ_c = λ/(1+λ), where λ is the sleeping rate, as well as the constant a = √λ / (1 + λ) characterising the lower order shift. Our approach utilises results about super-martingales associated with activated random walk that are of independent interest.

What carries the argument

Super-martingales associated with activated random walk that bound the particle count under the complete-graph dynamics.

Load-bearing premise

The super-martingale bounds on particle count hold for the complete-graph dynamics.

What would settle it

A direct simulation of the Markov chain for sufficiently large N in which the empirical average particle number lies outside ρ_c N + a √(N log N) + o(√(N log N)).

read the original abstract

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let the system stabilise following the activated random walk dynamics, obtaining a particle configuration with all sleeping particles. Particles visiting a boundary vertex are removed from the system. We characterise the support of the stationary distribution of this Markov chain, showing that, with high probability, the number of particles concentrates around the value $\rho_c N + a \sqrt{N \log N}$ with fluctuations of order at most $o( \sqrt{N \log N })$, where $N$ is the number of vertices. Due to the mean-field nature of the model, we are able to determine precisely the critical density $\rho_c= \frac{\lambda}{1+\lambda}$, where $\lambda$ is the sleeping rate, as well as the constant $a = \sqrt{\lambda} / (1 + \lambda) $ characterising the lower order shift. Our approach utilises results about super-martingales associated with activated random walk that are of independent interest.

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.

Referee Report

1 major / 1 minor

Summary. The paper models activated random walk on the complete graph via a discrete-time Markov chain that adds an active particle at a random vertex and stabilizes the system (with sleeping particles and boundary removal). It claims a rigorous characterization of the support of the stationary distribution: with high probability the particle count concentrates around ρ_c N + a √(N log N) with fluctuations o(√(N log N)), where ρ_c = λ/(1+λ) and a = √λ/(1+λ) are determined explicitly from the mean-field structure, relying on super-martingale bounds for the ARW dynamics.

Significance. If the super-martingale estimates are verified to deliver the stated tightness under complete-graph stabilization and boundary removal, the result supplies an explicit mean-field description of the critical density and sub-leading shift for this self-organized criticality model, together with super-martingale tools of independent interest. This would be a concrete advance in the analysis of ARW on mean-field graphs.

major comments (1)
  1. [Abstract (final sentence) and the section developing the super-martingale estimates] The central concentration claim with o(√(N log N)) fluctuations and the explicit value of a both rest on the super-martingale bounds holding with sufficient strength for the complete-graph dynamics including the boundary-removal step during stabilization. The abstract invokes these bounds as results of independent interest, but their precise application and tail estimates for this Markov chain must be checked to confirm they yield the claimed fluctuation control rather than weaker tails.
minor comments (1)
  1. Notation for the sleeping rate λ and the boundary mechanism should be introduced with a short self-contained definition in the introduction to aid readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for the constructive feedback. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract (final sentence) and the section developing the super-martingale estimates] The central concentration claim with o(√(N log N)) fluctuations and the explicit value of a both rest on the super-martingale bounds holding with sufficient strength for the complete-graph dynamics including the boundary-removal step during stabilization. The abstract invokes these bounds as results of independent interest, but their precise application and tail estimates for this Markov chain must be checked to confirm they yield the claimed fluctuation control rather than weaker tails.

    Authors: We thank the referee for emphasizing the need to verify the strength of the super-martingale bounds. The manuscript contains a dedicated section that derives these estimates specifically for the discrete-time Markov chain modeling activated random walk on the complete graph. The derivation incorporates the stabilization dynamics and the boundary-removal step at each stabilization. The resulting tail bounds are shown to be of sufficient strength to deliver the o(√(N log N)) fluctuation control, which is then used to establish the concentration of the stationary particle count around ρ_c N + a √(N log N). The same section presents the super-martingale results in a form that makes their independent interest explicit, and the subsequent application to the mean-field model is carried out in detail in the proof of the main theorem. revision: no

Circularity Check

0 steps flagged

No circularity; derivation self-contained via direct Markov chain analysis and independent super-martingale bounds

full rationale

The paper defines a discrete-time Markov chain on particle configurations for activated random walk on the complete graph (with boundary removal), then characterizes the support of its stationary distribution directly from the mean-field dynamics. The critical density ρ_c = λ/(1+λ) and shift constant a = √λ/(1+λ) are obtained from the model parameters without any fitted inputs renamed as predictions or self-definitional loops. Super-martingale results are invoked as of independent interest and appear to be established within the work rather than presupposed via self-citation chains. No load-bearing step reduces by construction to its own inputs; the concentration claim around ρ_c N + a √(N log N) with o(√(N log N)) fluctuations follows from the stated stabilization analysis.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

No free parameters, invented entities, or ad-hoc axioms are introduced; the result rests on standard Markov-chain stationarity and super-martingale inequalities whose details are not supplied in the abstract.

axioms (2)
  • standard math Existence and uniqueness of the stationary distribution for the discrete-time Markov chain on particle configurations
    Invoked implicitly when the authors speak of the stationary distribution of the chain.
  • domain assumption Super-martingale bounds for activated random walk hold on the complete graph
    Explicitly referenced in the final sentence as the key technical tool.

pith-pipeline@v0.9.0 · 5744 in / 1390 out tokens · 26696 ms · 2026-05-24T09:41:43.495264+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Law of large numbers for activated random walk on villages

    math.PR 2026-05 unverdicted novelty 7.0

    Under subcritical initial conditions, the activated random walk on villages satisfies a law of large numbers as n goes to infinity, with the limit given by a unique solution to a system of nonlinear equations.

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

    math.PR 2026-04 unverdicted novelty 7.0

    Activated random walk on the complete graph with sink has Gumbel scaling for sleeping particles when exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}, density converges to p only for exponentially weak sinks, and jumps to stabilization...

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

    math.PR 2026-04 unverdicted novelty 7.0

    Activated random walk on the complete graph has a Gumbel scaling limit for sleeping particles and hyperuniform stationary law when the sink probability satisfies exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages · cited by 2 Pith papers

  1. [1]

    Asselah, N

    A. Asselah, N. Forien, and A. Gaudilli` ere. The Critical Density for Activated Random Walks is always less than 1 . 2022. arXiv: 2210.04779 [math.PR]

    work page arXiv 2022

  2. [2]

    Diffusive bounds for the critical density of activated random walks

    A. Asselah, L. T. Rolla, and B. Schapira. “Diffusive bounds for the critical density of activated random walks”. ALEA Lat. Am. J. Probab. Math. Stat. 19.1 (2022), pages 457–

    work page 2022

  3. [3]

    doi: 10.30757/alea.v19-17

    work page doi:10.30757/alea.v19-17

  4. [4]

    Self-organized crit icality: An explanation of the 1/f noise

    P. Bak, C. Tang, and K. Wiesenfeld. “Self-organized crit icality: An explanation of the 1/f noise”. Phys. Rev. Lett. 59 (4 July 1987), pages 381–384. doi: 10.1103/PhysRevLett.59.381. 40

    work page doi:10.1103/physrevlett.59.381 1987

  5. [5]

    Non-fixation for conse rvative stochastic dynamics on the line

    R. Basu, S. Ganguly, and C. Hoffman. “Non-fixation for conse rvative stochastic dynamics on the line”. Comm. Math. Phys. 358.3 (2018), pages 1151–1185. doi: 10.1007/s00220-017-3059-7

    work page doi:10.1007/s00220-017-3059-7 2018

  6. [6]

    Recurrence times for the Ehren fest model

    R. Bellman and T. Harris. “Recurrence times for the Ehren fest model”. Pacific J. Math. 1 (1951), pages 179–193

    work page 1951

  7. [7]

    Bristiel and J

    A. Bristiel and J. Salez. Separation cutoff for Activated Random Walks . 2022. arXiv: 2209.03274 [math.PR]

    work page arXiv 2022

  8. [8]

    Non-equil ibrium phase transitions: acti- vated random walks at criticality

    M. Cabezas, L. T. Rolla, and V. Sidoravicius. “Non-equil ibrium phase transitions: acti- vated random walks at criticality”. J. Stat. Phys. 155.6 (2014), pages 1112–1125. doi: 10.1007/s10955-013-0909-3

    work page doi:10.1007/s10955-013-0909-3 2014

  9. [9]

    The first passage probl em for a continuous Markov pro- cess

    D. A. Darling and A. J. F. Siegert. “The first passage probl em for a continuous Markov pro- cess”. Ann. Math. Statistics 24 (1953), pages 624–639. doi: 10.1214/aoms/1177728918

    work page doi:10.1214/aoms/1177728918 1953

  10. [10]

    Theoretical studies of self-organized critic ality

    D. Dhar. “Theoretical studies of self-organized critic ality”. Phys. A 369.1 (2006), pages 29–

    work page 2006

  11. [11]

    doi: 10.1016/j.physa.2006.04.004

    work page doi:10.1016/j.physa.2006.04.004 2006

  12. [12]

    Activate d random walkers: facts, conjec- tures and challenges

    R. Dickman, L. T. Rolla, and V. Sidoravicius. “Activate d random walkers: facts, conjec- tures and challenges”. J. Stat. Phys. 138.1-3 (2010), pages 126–142. doi: 10.1007/s10955-009-9918-7

    work page doi:10.1007/s10955-009-9918-7 2010

  13. [13]

    R. Durrett. Stochastic calculus. Probability and Stochastics Series. A practical introduc - tion. CRC Press, Boca Raton, FL, 1996, pages x+341

    work page 1996

  14. [14]

    Approach to critica lity in sandpiles

    A. Fey, L. Levine, and D. B. Wilson. “Approach to critica lity in sandpiles”. Phys. Rev. E 82 (3 Sept. 2010), page 031121. doi: 10.1103/PhysRevE.82.031121

    work page doi:10.1103/physreve.82.031121 2010

  15. [15]

    Forien and A

    N. Forien and A. Gaudilli` ere. Active Phase for Activated Random Walks on the Lattice in all Dimensions . 2022. arXiv: 2203.02476 [math.PR]

    work page arXiv 2022

  16. [16]

    Active phase for ac tivated random walk on Z

    C. Hoffman, J. Richey, and L. T. Rolla. “Active phase for ac tivated random walk on Z”. Comm. Math. Phys. 399.2 (2023), pages 717–735. doi: 10.1007/s00220-022-04572-x

    work page doi:10.1007/s00220-022-04572-x 2023

  17. [17]

    A. A. J´ arai and Elvidge. Scaling and partial universality of the height zero probabi lity in the 2D Abelian sandpile, In preparation. 2024

    work page 2024

  18. [18]

    Sandpile models

    A. A. J´ arai. “Sandpile models”. Probab. Surv. 15 (2018), pages 243–306. doi: 10.1214/14-PS228

    work page doi:10.1214/14-ps228 2018

  19. [19]

    G. F. Lawler and V. Limic. Random walk: a modern introduction . Volume 123. Cam- bridge Studies in Advanced Mathematics. Cambridge Univers ity Press, Cambridge, 2010, pages xii+364. doi: 10.1017/CBO9780511750854

    work page doi:10.1017/cbo9780511750854 2010

  20. [20]

    Levine and F

    L. Levine and F. Liang. Exact sampling and fast mixing of Activated Random Walk . 2023. arXiv: 2110.14008 [math.PR]

    work page arXiv 2023

  21. [21]

    Universality conjectures for activated random walk

    L. Levine and V. Silvestri. “Universality conjectures for activated random walk”. Probab. Surv. 21 (2024), pages 1–27. doi: 10.1214/24-ps25

    work page doi:10.1214/24-ps25 2024

  22. [22]

    Erd˝ os-R´ enyi random graphs + forest fires = self-organized criti- cality

    B. R´ ath and B. T´ oth. “Erd˝ os-R´ enyi random graphs + forest fires = self-organized criti- cality”. Electron. J. Probab. 14 (2009), no. 45, 1290–1327. doi: 10.1214/EJP.v14-653

    work page doi:10.1214/ejp.v14-653 2009

  23. [23]

    Non-fixation for biased act ivated random walks

    L. T. Rolla and L. Tournier. “Non-fixation for biased act ivated random walks”. Ann. Inst. Henri Poincar´ e Probab. Stat.54.2 (2018), pages 938–951. doi: 10.1214/17-AIHP827

    work page doi:10.1214/17-aihp827 2018

  24. [24]

    Absorbing-state phas e transition for driven-dissipative stochastic dynamics on Z

    L. T. Rolla and V. Sidoravicius. “Absorbing-state phas e transition for driven-dissipative stochastic dynamics on Z”. Invent. Math. 188.1 (2012), pages 127–150. doi: 10.1007/s00222-011-0344-5

    work page doi:10.1007/s00222-011-0344-5 2012

  25. [25]

    Universali ty and sharpness in activated ran- dom walks

    L. T. Rolla, V. Sidoravicius, and O. Zindy. “Universali ty and sharpness in activated ran- dom walks”. Ann. Henri Poincar´ e20.6 (2019), pages 1823–1835. doi: 10.1007/s00023-019-00797-0

    work page doi:10.1007/s00023-019-00797-0 2019

  26. [26]

    Nonfixation for activated random walks

    E. Shellef. “Nonfixation for activated random walks”. ALEA Lat. Am. J. Probab. Math. Stat. 7 (2010), pages 137–149

    work page 2010

  27. [27]

    Absorbing-state tra nsition for stochastic sandpiles and activated random walks

    V. Sidoravicius and A. Teixeira. “Absorbing-state tra nsition for stochastic sandpiles and activated random walks”. Electron. J. Probab. 22 (2017), Paper No. 33, 35. doi: 10.1214/17-EJP50. 41

    work page doi:10.1214/17-ejp50 2017

  28. [28]

    Critical density of activated r andom walks on transitive graphs

    A. Stauffer and L. Taggi. “Critical density of activated r andom walks on transitive graphs”. Ann. Probab. 46.4 (2018), pages 2190–2220. doi: 10.1214/17-AOP1224

    work page doi:10.1214/17-aop1224 2018

  29. [29]

    Absorbing-state phase transition in biased activated random walk

    L. Taggi. “Absorbing-state phase transition in biased activated random walk”. Electron. J. Probab. 21 (2016), Paper No. 13, 15. doi: 10.1214/16-EJP4275

    work page doi:10.1214/16-ejp4275 2016

  30. [30]

    Active phase for activated random walks on Zd, d ≥ 3, with density less than one and arbitrary sleeping rate

    L. Taggi. “Active phase for activated random walks on Zd, d ≥ 3, with density less than one and arbitrary sleeping rate”. Ann. Inst. Henri Poincar´ e Probab. Stat. 55.3 (2019), pages 1751–1764. doi: 10.1214/18-aihp933

    work page doi:10.1214/18-aihp933 2019

  31. [31]

    Essential enhancements in Abelian networks : Continuity and uniform strict monotonicity

    L. Taggi. “Essential enhancements in Abelian networks : Continuity and uniform strict monotonicity”. Ann. Probab. 51.6 (2023), pages 2243–2264. doi: 10.1214/23-aop1647

    work page doi:10.1214/23-aop1647 2023

  32. [32]

    E. T. Whittaker and G. N. Watson. A course of modern analysis . Cambridge Mathe- matical Library. An introduction to the general theory of in finite processes and of ana- lytic functions; with an account of the principal transcend ental functions, Reprint of the fourth (1927) edition. Cambridge University Press, Cambri dge, 1996, pages vi+608. doi: 10.1017...

    work page doi:10.1017/cbo9780511608759 1927