Chip-Firing and Rotor-Routing on $\mathbb{Z}^d$ and on Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

Chip-Firing and Rotor-Routing on $\mathbb{Z}^d$ and on Trees


The sandpile group of a graph $G$ is an abelian group whose order is the number of spanning trees of $G$. We find the decomposition of the sandpile group into cyclic subgroups when $G$ is a regular tree with the leaves are collapsed to a single vertex. This result can be used to understand the behavior of the rotor-router model, a deterministic analogue of random walk studied first by physicists and more recently rediscovered by combinatorialists. Several years ago, Jim Propp simulated a simple process called rotor-router aggregation and found that it produces a near perfect disk in the integer lattice $\mathbb{Z}^2$. We prove that this shape is close to circular, although it remains a challenge to explain the near perfect circularity produced by simulations. In the regular tree, we use the sandpile group to prove that rotor-router aggregation started from an acyclic initial condition yields a perfect ball.
Fichier principal
Vignette du fichier
dmAJ0151.pdf (713.3 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01185153 , version 1 (19-08-2015)



Itamar Landau, Lionel Levine, Yuval Peres. Chip-Firing and Rotor-Routing on $\mathbb{Z}^d$ and on Trees. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Viña del Mar, Chile. pp.587-598, ⟨10.46298/dmtcs.3618⟩. ⟨hal-01185153⟩


206 View
660 Download



Gmail Facebook X LinkedIn More