Abelian and stochastic sandpile models on complete bipartite graphs
<|reference_start|>Abelian and stochastic sandpile models on complete bipartite graphs: In the sandpile model, vertices of a graph are allocated grains of sand. At each unit of time, a grain is added to a randomly chosen vertex. If that causes its number of grains to exceed its degree, that vertex is called unstable, and topples. In the Abelian sandpile model (ASM), topplings are deterministic, whereas in the stochastic sandpile model (SSM) they are random. We study the ASM and SSM on complete bipartite graphs. For the SSM, we provide a stochastic version of Dhar's burning algorithm to check if a given (stable) configuration is recurrent or not, with linear complexity. We also exhibit a bijection between sorted recurrent configurations and pairs of compatible Ferrers diagrams. We then provide a similar bijection for the ASM, and also interpret its recurrent configurations in terms of labelled Motzkin paths.<|reference_end|>
@article{selig2024abelian,
    title={Abelian and stochastic sandpile models on complete bipartite graphs},
    author={Thomas Selig and Haoyue Zhu},
    journal={arXiv preprint arXiv:2409.11811},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.11811},
    primaryClass={math.CO cs.DM math.PR}
}