Publications
Publications
- Archiv der Mathematik
A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips
By: Paul Myer Kominers and Scott Duke Kominers
Abstract
We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V(G)| chips stabilizes, i.e., such a game has eventual period of length 1. Furthermore, we obtain a polynomial bound on the number of rounds before stabilization. This result is a counterpoint to previous results which showed that the eventual periods of parallel chip-firing games with few chips need not be polynomially bounded.
Keywords
Citation
Kominers, Paul Myer, and Scott Duke Kominers. "A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips." Archiv der Mathematik 95, no. 1 (July 2010): 9–13.
About The Author
