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 behav...
Main Authors: | Itamar Landau, Lionel Levine, Yuval Peres |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3618/pdf |
Similar Items
-
Weak Positional Games on Hypergraphs of Rank Three
by: Martin Kutz
Published: (2005-01-01) -
Bigraphical arrangements
by: Sam Hopkins, et al.
Published: (2014-01-01) -
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes
by: Vladimir Blinovsky
Published: (2005-01-01)