English
Related papers

Related papers: Improved bounds on the sandpile diffusions on Grid…

200 papers

We consider the abelian stochastic sandpile model. In this model, a site is deemed unstable when it contains more than one particle. Each unstable site, independently, is toppled at rate $1$, sending two of its particles to neighbouring…

Probability · Mathematics 2021-03-17 Moumanti Podder , Leonardo T. Rolla

Working in the setting of i.i.d. last-passage percolation on $\mathbb{R}^D$ with no assumptions on the underlying edge\hyp{}weight distribution, we arrive at the notion of grid entropy - a Subadditive Ergodic Theorem limit of the entropies…

Probability · Mathematics 2023-12-14 Alexandru Gatea

Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Ne\v{s}et\v{r}il and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a…

Combinatorics · Mathematics 2012-05-21 Jaroslav Nešetřil , Patrice Ossona de Mendez , David R. Wood

We study the surface roughness of prototype models displaying self-organized criticality (SOC) and their noncritical variants in one dimension. For SOC systems, we find that two seemingly equivalent definitions of surface roughness yields…

Statistical Mechanics · Physics 2009-11-10 J. G. Oliveira , J. F. F. Mendes , G. Tripathy

We introduce two sandpile models which show the same behavior of real sandpiles, that is, an almost self-organized critical behavior for small systems and the dominance of large avalanches as the system size increases. The systems become…

Statistical Mechanics · Physics 2009-11-07 Maria de Sousa Vieira

We give nearly optimal bounds on the sample complexity of $(\widetilde{\Omega}(\epsilon),\epsilon)$-tolerant testing the $\rho$-independent set property in the dense graph setting. In particular, we give an algorithm that inspects a random…

Data Structures and Algorithms · Computer Science 2025-03-28 Cameron Seth

We study Abelian sandpiles on graphs of the form $G \times I$, where $G$ is an arbitrary finite connected graph, and $I \subset \Z$ is a finite interval. We show that for any fixed $G$ with at least two vertices, the stationary measures…

Probability · Mathematics 2010-04-27 Antal A. Járai , Russell Lyons

A mean-field sandpile model that exhibits self-organized criticality (SOC) despite violation of the grain-transfer conservation law during avalanches is proposed. The sandpile consists of $N$ agents and possesses background activity with…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Dranreb Earl Juanico

The Abelian Sandpile Model is a cellular automaton whose discrete dynamics reaches an out-of-equilibrium steady state resembling avalanches in piles of sand. The fundamental moves defining the dynamics are encoded by the toppling rules. The…

Statistical Mechanics · Physics 2012-09-25 Sergio Caracciolo , Guglielmo Paoletti , Andrea Sportiello

We study the abelian sandpile model in two dimensions on a directed cylindrical lattice with periodic transverse boundary conditions in the transverse direction and dissipation at one boundary. Recurrent configurations form a finite abelian…

Statistical Mechanics · Physics 2026-05-18 Abdul Quadir , Nikita Kalinin , Ram Ramaswamy

We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…

Probability · Mathematics 2026-05-19 Josué Corujo

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…

Probability · Mathematics 2024-04-25 Umberto De Ambroggio , Tamás Makai , Konstantinos Panagiotou , Annika Steibel

We consider the anomalous sub-diffusion of a class of Gaussian processes that can be expressed in terms of sums of Ornstein-Uhlenbeck processes. As a generic class of processes, we introduce a single parameter such that for any $\nu \in…

Probability · Mathematics 2009-11-24 Scott A McKinley

We prove a necessary and sufficient condition for an Abelian Sandpile Model (ASM) to be avalanche-finite, namely: all unstable states of the system can be brought back to stability in finite number of topplings. The method is also…

adap-org · Physics 2015-06-24 S. W. Chan , H. F. Chau

In the single-source sandpile model, a number $N$ grains of sand are positioned at a central vertex on the 2-dimensional grid $\mathbb{Z}^2$. We study the stabilisation of this configuration for a stochastic sandpile model based on a…

Probability · Mathematics 2022-08-23 Thomas Selig , Haoyue Zhu

We investigate the avalanche dynamics of the abelian sandpile model on arbitrarily large balls of the expanded cactus graph (the Cayley graph of the free product $\mathbb{Z}_3 * \mathbb{Z}_2$). We follow the approach of Dhar and Majumdar…

Mathematical Physics · Physics 2012-05-01 Gregory Gauthier

Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "\emph{controlled diffusion}" steps needed to transport a constant mass $p$ outside of the ball of radius $n$. In a step of a controlled diffusion…

Combinatorics · Mathematics 2017-03-30 Laura Florescu , Yuval Peres , Miklos Z. Racz

A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…

Probability · Mathematics 2007-05-23 Alexey M. Kulik

The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…

We study the abelian sandpile growth model, where n particles are added at the origin on a stable background configuration in Z^d. Any site with at least 2d particles then topples by sending one particle to each neighbor. We find that with…

Combinatorics · Mathematics 2010-04-08 Anne Fey , Lionel Levine , Yuval Peres