Search arXiv⌕ Search

arXiv · 0704.2913

Ladder Sandpiles

Abstract

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 $μ_I = μ_{G \times I}$ have two extremal weak limit points as $I \uparrow \Z$. The extremal limits are the only ergodic measures of maximum entropy on the set of infinite recurrent configurations. We show that under any of the limiting measures, one can add finitely many grains in such a way that almost surely all sites topple infinitely often. We also show that the extremal limiting measures admit a Markovian coding.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antal A. Járai, Russell Lyons. 2007-08-13. Ladder Sandpiles. https://arxiv.org/abs/0704.2913

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

KEEP EXPLORING

Related papers

Sharp singularity asymptotics for discrete random matrices

We resolve the Rademacher singularity conjecture: an $n\times n$ matrix with independent uniform $\{-1,1\}$ entries is singular with probability $(2+o(1))n^22^{-n}$. More generally, for an $n\times n$ matrix $M_n$ with independent entries uniform on a fixed set $S\subset\mathbb{R}$ of cardinality $q\ge2$, we prove $\mathbb{P}(s_n(M_n)\le z/\sqrt{n}) \le Cz+a_n(S)+C'n^{1+\varepsilon}q^{-n}$ for all $n\ge1$, $z\ge0$, and $\varepsilon>0$, with $C=C(S)$ and $C'=C'(S,\varepsilon)$. Here $s_n$ denotes the least singular value, and $a_n(S)$ is the sum of the probabilities of the events involving zero rows or columns and equal or opposite pairs of rows or columns.

math.PR↗

Exact Endpoint Asymptotics and Almost-Sure Limits for Uniform Empirical Measures in Two Dimensions

For the empirical measure of the first $n$ points of one infinite sequence of independent uniform samples in the unit square, we identify the leading constant in the bounded-Lipschitz distance to area measure, equivalently in $W_1$, both in expectation and almost surely along all sample sizes. The constant is $c_*=κ_1/(2\sqrtπ)\in(0,1/4]$, where $κ_1$ is the linear-growth Gaussian variational constant of Armegioiu--Goldman--Grotto--Trevisan. This answers the two-dimensional bounded-Lipschitz convergence question posed by Yukich in 1989. We give the complete endpoint argument, square--torus comparison, empirical reduction, and full-sequence probability argument.

math.PR↗

Normal approximation for total magnetization in subcritical long-range Ising models

We establish Berry--Esseen bounds and 1-Wassershtein bounds for the total spin of strictly subcritical zero-field Ising models with summable interactions. Let $J:\mathbb Z^d\to[0,\infty)$ be symmetric, satisfy $J(0)=0$, and $\|J\|_1:=\sum_{x\in\mathbb Z^d}J(x)<\infty$. For a nonempty finite set $Λ\subset\mathbb Z^d$, consider zero-field Gibbs measure with free boundary conditions, in which a spin configuration $σ\in\{-1,+1\}^Λ$ has probability proportional to \[ \exp\!\left\{ β\sum_{x,y\inΛ} J(x-y)σ_xσ_y \right\}. \] Let $S_Λ:=\sum_{x\inΛ}σ_x$ be the total spin and $β_{\mathrm c}$ denote the critical inverse temperature. For every fixed $0\leqβ<β_{\mathrm c}$, we prove that \[ d_{\mathrm K}\!\left( \frac{S_Λ}{\sqrt{\operatorname{Var}(S_Λ)}},G \right) \leq C_{β,J}|Λ|^{-1/2}, \] where $d_{\mathrm K}$ is the Kolmogorov distance, $G\sim \mathcal{N}(0,1)$, and $C_{β,J}$ depends only on $β$ and $J$. For the fully periodized model on $(\mathbb Z/L\mathbb Z)^d$, the corresponding rate is $L^{-d/2}$, uniformly in $L$. For the classical nearest-neighbor model, the Kolmogorov bound also holds for $-β_{\mathrm c}<β<β_{\mathrm c}$, covering both ferromagnetic and antiferromagnetic interactions. We also obtain $1$-Wasserstein bounds with the same rates in the respective subcritical regimes. Both the Kolmogorov and $1$-Wasserstein bounds hold with the same rate under the corresponding infinite-volume free-boundary Gibbs measures.

math.PR↗