SearcharxivSearch

arXiv · 2609.02829

Quantitative explosion and percolation of the divisible sandpile

Abstract

The divisible sandpile on $\mathbb{Z}^d$ starts from i.i.d. masses at each site, and, in each discrete time step, a site with mass above one keeps one unit and sends the excess equally to its neighbors. Levine, Murugan, Peres and Ugurcan (2016) showed that at mean one this process explodes, with every site emitting infinite mass. We show that the mass emitted from a site by time $t$ is of order $t^{(4-d)/4}$ for $d\leq3$, of order $\log t$ for $d=4$, and a tail-dependent, divergent rate for $d\geq5$. We further show that the mass emitted, after diffusive rescaling, converges to a Brownian optimal-stopping value for $d\leq3$ and to tail-dependent, weighted membrane fields for $d\geq5$, while at the critical dimension $d=4$, after superdiffusive rescaling, it converges to the membrane model. Using these estimates, we prove that, for every $d\geq2$, the set of sites that topple contains an infinite component at some mean below one, hence it has a non-trivial percolation phase transition. This answers a variant of a question of Fey, Meester and Redig (2009). The proof adapts ideas from the theory of level-set percolation of strongly correlated Gaussian fields.

Explore related subjects

Keep this discovery

BibTeXRIS

Ahmed Bou-Rabee, Christoforos Panagiotis. 2026-09-02. Quantitative explosion and percolation of the divisible sandpile. https://arxiv.org/abs/2609.02829

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR