Ladder sandpiles

Antal Jarai, Russell Lyons

Research output: Contribution to journalArticlepeer-review

Abstract

We study Abelian sandpiles on graphs of the form G×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×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.
Original languageEnglish
Pages (from-to)493-518
Number of pages15
JournalMarkov Processes and Related Fields
Volume13
Publication statusPublished - 2007

Fingerprint Dive into the research topics of 'Ladder sandpiles'. Together they form a unique fingerprint.

Cite this