# Threshold State and a Conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle

@article{Levine2014ThresholdSA,
title={Threshold State and a Conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle},
author={Lionel Levine},
journal={Communications in Mathematical Physics},
year={2014},
volume={335},
pages={1003-1017}
}
• Lionel Levine
• Published 13 February 2014
• Mathematics
• Communications in Mathematical Physics
We prove a precise relationship between the threshold state of the fixed-energy sandpile and the stationary state of Dhar’s abelian sandpile: in the limit as the initial condition s0 tends to $${-\infty}$$-∞ , the former is obtained by size-biasing the latter according to burst size, an avalanche statistic. The question of whether and how these two states are related has been a subject of some controversy since 2000.The size-biasing in our result arises as an instance of a Markov renewal…
Sandpiles on the Square Lattice
• Mathematics
Communications in Mathematical Physics
• 2019
AbstractWe give a non-trivial upper bound for the critical density when stabilizing i.i.d. distributed sandpiles on the lattice $${\mathbb{Z}^2}$$Z2 . We also determine the asymptotic spectral gap,
Mixing time and eigenvalues of the abelian sandpile Markov chain
• Mathematics
Transactions of the American Mathematical Society
• 2019
The abelian sandpile model defines a Markov chain whose states are integer-valued functions on the vertices of a simple connected graph G G . By viewing this chain as a (nonreversible)
Non-fixation for Conservative Stochastic Dynamics on the Line
• Mathematics
• 2015
We consider activated random walk (ARW), a model which generalizes the stochastic sandpile, one of the canonical examples of self organized criticality. Informally ARW is a particle system on
Activated random walk on a cycle
• Mathematics
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
• 2019
We consider Activated Random Walk (ARW), a particle system with mass conservation, on the cycle $\mathbb{Z}/n\mathbb{Z}$. One starts with a mass density $\mu>0$ of initially active particles, each of
Abelian networks IV. Dynamics of nonhalting networks
• Mathematics
Memoirs of the American Mathematical Society
• 2022
An intrinsic definition of the torsion group of a finite irreducible (halting or nonhalting) abelian network is given, and it is shown that it coincides with the critical group of Bond and Levine (2016) if the network is halting.
Absorbing-state transition for Stochastic Sandpiles and Activated Random Walks
• Mathematics
• 2014
We study the dynamics of two conservative lattice gas models on the infinite d-dimensional hypercubic lattice: the Activated Random Walks (ARW) and the Stochastic Sandpiles Model (SSM), introduced in
The multivariate avalanche polynomial∗
• Mathematics, Computer Science
• 2018
The multivariate avalanche polynomial is introduced that enumerates the toppling sequences of all principal avalanches and is characterized for trees, cycles, wheels, and complete graphs.
Exact sampling and fast mixing of Activated Random Walk
• Mathematics
• 2021
Activated Random Walk (ARW) is an interacting particle system on the d-dimensional lattice Z. On a finite subset V ⊂ Z it defines a Markov chain on {0, 1} . We prove that when V is a Euclidean ball
CoEulerian graphs
• Mathematics
• 2015
We suggest a measure of “Eulerianness” of a finite directed graph and define a class of “coEulerian” graphs. These are the graphs whose Laplacian lattice is as large as possible. As an application,
Abelian Networks I. Foundations and Examples
• Computer Science
SIAM J. Discret. Math.
• 2016
In Deepak Dhar's model of abelian distributed processors, automata occupy the vertices of a graph and communicate via the edges. We show that two simple axioms ensure that the final output does not

## References

SHOWING 1-10 OF 34 REFERENCES
Approach to criticality in sandpiles.
• Mathematics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2010
It is shown that driven-dissipative sandpiles continue to evolve even after a constant fraction of the sand has been lost at the sink, and is proved that the density conjecture is false when the underlying graph is any of Z2, the complete graph K(n), the Cayley tree, the ladder graph, the bracelet graph, or the flower graph.
Infinite Volume Limit for the Stationary Distribution of Abelian Sandpile Models
• Mathematics
• 2003
We study the stationary distribution of the standard Abelian sandpile model in the box Λn = [-n, n]d ∩ ℤd for d≥ 2. We show that as n→ ∞, the finite volume stationary distributions weakly converge to
Convergence of the Abelian sandpile
• Mathematics
• 2011
The Abelian sandpile growth model is a diffusion process for configurations of chips placed on vertices of the integer lattice $\mathbb{Z}^d$, in which sites with at least 2d chips {\em topple},
Stabilizability and percolation in the infinite volume sandpile model
• Mathematics
• 2007
We study the sandpile model in infinite volume on Z d . In particular, we are interested in the question whether or not initial configurations, chosen according to a stationary measure μ, are
Inverse avalanches in the Abelian sandpile model.
• Mathematics
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
• 1994
The inverse of particle addition process in the Abelian sandpile model is defined and the unique recurrent configuration corresponding to a single particle deletion is obtained by a sequence of operations called inverse avalanches.
Numerical study of the correspondence between the dissipative and fixed-energy Abelian sandpile models.
• Physics
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2011
The extensive Monte Carlo simulations show that the threshold density ρ(th)(h(0)) of the FES converges rapidly to ρ (s) for h(0) < 1 and the conservative fixed energy sandpile (FES).
Chip-Firing Game and a Partial Tutte Polynomial for Eulerian Digraphs
• Mathematics
Electron. J. Comb.
• 2016
It is proved that the generating function of the set of recurrent configurations of an Eulerian digraph is a natural and convincing candidate for generalizing the partial Tutte polynomial to general digraphs, a class on the way from undirected graphs to generalDigraphs.