The Avalanche Polynomial of a Graph
Authors:
Preprint
Abstract
The (univariate) avalanche polynomial of a graph, introduced by Cori, Dartois and Rossin in 2006, captures the distribution of the length of (principal) avalanches in the abelian sandpile model. This polynomial has been used to show that the avalanche distribution in the sandpile model on a multiple wheel graph does not follow the expected power law function. In this article, we introduce the (multivariate) avalanche polynomial that enumerates the toppling sequences of all principal avalanches. This polynomial generalizes the univariate avalanche polynomial and encodes more information. In particular, the avalanche polynomial of a tree uniquely identifies the underlying tree. In this paper, the avalanche polynomial is characterized for trees, cycles, wheels, and complete graphs.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Threshold State and a Conjecture of Poghosyan, Poghosyan, Priezzhev and RuelleCommunications in Mathematical Physics, 2014
- Power laws and self-organized criticality in theory and naturePhysics Reports, 2014
- -parking functions, acyclic orientations and spanning treesDiscrete Mathematics, 2010
- Chip-Firing and Rotor-Routing on Directed Graphs2008
- Riemann–Roch and Abel–Jacobi theory on a finite graphAdvances in Mathematics, 2007
- The chip-firing gameDiscrete Mathematics, 2005
- On the Sandpile Group of Dual GraphsEuropean Journal of Combinatorics, 2000
- Chip-Firing and the Critical Group of a GraphJournal of Algebraic Combinatorics, 1999
- Chip-Firing Games on Directed GraphsJournal of Algebraic Combinatorics, 1992
- Arithmetical graphsMathematische Annalen, 1989