2000 character limit reached
Stochastic Sandpile on a Cycle
Published 19 Dec 2021 in math.PR and cond-mat.stat-mech | (2112.10243v1)
Abstract: In the stochastic sandpile model on a graph, particles interact pairwise as follows: if two particles occupy the same vertex, they must each take an independent random walk step with some probability $0<p<1$ of not moving. These interactions continue until each site has no more than one particle on it. We provide a formal coupling between the stochastic sandpile and the activated random walk models, and we use the coupling to show that for the stochastic sandpile with particles on the cycle graph the system stabilizes in time for all initial particle configurations, provided that tends to $1$ sufficiently rapidly as .
Paper Prompts
Sign up for free to create and run prompts on this paper.