Papers
Topics
Authors
Recent
Search
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 nn particles on the cycle graph Zn,\mathbb{Z}_n, the system stabilizes in O(n<sup>3)O(n<sup>3) time for all initial particle configurations, provided that p(n)p(n) tends to $1$ sufficiently rapidly as n→∞n \rightarrow \infty.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.