Sandpiles, Spanning Trees, and Plane Duality

@article{Chan2015SandpilesST,
title={Sandpiles, Spanning Trees, and Plane Duality},
author={Melody Chan and Darren B. Glass and Matthew Macauley and David Perkinson and Caryn Werner and Qiaoyu Yang},
journal={SIAM J. Discret. Math.},
year={2015},
volume={29},
pages={461-471}
}
• Published 19 June 2014
• Mathematics
• SIAM J. Discret. Math.
Let $G$ be a connected, loopless multigraph. The sandpile group of $G$ is a finite abelian group associated to $G$ whose order is equal to the number of spanning trees in $G$. Holroyd et al. used a dynamical process on graphs called rotor-routing to define a simply transitive action of the sandpile group of $G$ on its set of spanning trees. Their definition depends on two pieces of auxiliary data: a choice of a ribbon graph structure on $G$, and a choice of a root vertex. Chan, Church, and…
6 Citations
The Bernardi process and torsor structures on spanning trees
• Mathematics
• 2014
Let G be a ribbon graph, i.e., a connected finite graph G together with a cyclic ordering of the edges around each vertex. By adapting a construction due to O. Bernardi, we associate to any pair
GEOMETRIC BIJECTIONS FOR REGULAR MATROIDS, ZONOTOPES, AND EHRHART THEORY
• Mathematics
Forum of Mathematics, Sigma
• 2019
Let $M$ be a regular matroid. The Jacobian group $\text{Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$ . This group generalizes the definition of
Recognizing hyperelliptic graphs in polynomial time
• Mathematics, Computer Science
WG
• 2018
Hyperelliptic graphs are considered and a safe and complete set of reduction rules for such multigraphs are provided, showing that they can be recognized in time.
The sandpile group of a trinity and a canonical definition for the planar Bernardi action
• Mathematics
• 2019
Baker and Wang define the so called Bernardi action of the sandpile group of a ribbon graph on the set of its spanning trees. This potentially depends on a fixed vertex of the graph but they prove

References

SHOWING 1-10 OF 14 REFERENCES
Rotor-Routing and Spanning Trees on Planar Graphs
• Mathematics
• 2015
The sandpile group Pic^0(G) of a finite graph G is a discrete analogue of the Jacobian of a Riemann surface which was rediscovered several times in the contexts of arithmetic geometry, self-organized
The Bernardi process and torsor structures on spanning trees
• Mathematics
• 2014
Let G be a ribbon graph, i.e., a connected finite graph G together with a cyclic ordering of the edges around each vertex. By adapting a construction due to O. Bernardi, we associate to any pair
Tutte Polynomial, Subgraphs, Orientations and Sandpile Model: New Connections via Embeddings
The bijection $\Phi$ is closely related to a recent characterization of the Tutte polynomial relying on combinatorial embeddings of graphs, that is, on a choice of cyclic order of the edges around each vertex.
On the Sandpile Group of Dual Graphs
• Mathematics
Eur. J. Comb.
• 2000
It is proved that the sandpile group of planar graph is isomorphic to that of its dual, and a combinatorial point of view on the subject is developed.
Eulerian Walkers as a Model of Self-Organized Criticality.
• Computer Science
Physical review letters
• 1996
The operators corresponding to particle addition generate an Abelian group, same as the group for the Abelian sandpile model on the graph, and this equivalence determines the critical steady state and some critical exponents exactly.
Chip-Firing and Rotor-Routing on Directed Graphs
• Mathematics
• 2008
We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing
The lattice of integral flows and the lattice of integral cuts on a finite graph
• Mathematics
• 1997
Les flots entiers sur un graphe fini Γ constituent naturellement un reseau entier Λ 1 (Γ) dans l'espace euclidien Ker(Δ 1 ) des fonctions harmoniques a valeurs reelles sur l'ensemble des aretes de Γ.
The Tutte polynomial
• D. Welsh
• Mathematics
Random Struct. Algorithms
• 1999
Some new interpretations relating to random graphs, lattice point enumeration, and chip firing games are presented and complexity issues are examined, in particular, on the existence of randomized approximation schemes.
P
• de la Harpe, and T. Nagnibeda, The lattice of integral flows and the lattice of integral cuts on a finite graph, Bull. Soc. Math. France, 125
• 1997