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.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Biggs N.L.: Chip-firing and the critical group of a graph. J. Algebraic Combin. 9, 25–45 (1999)
Bitar J., Goles E.: Parallel chip firing games on graphs. Theoret. Comput. Sci. 92, 291–300 (1992)
Björner A., Lovász L., Shor P.: Chip-firing games on graphs. European J. Combin. 12, 283–291 (1991)
Kiwi M.A. et al.: No polynomial bound for the period of the parallel chip firing game on graphs. Theoret. Comput. Sci. 136, 527–532 (1994)
Kominers P.M.: The candy-passing game for c ≥ 3n − 2. Pi Mu Epsilon J. 12, 459–460 (2008)
López C.M.: Chip firing and the Tutte polynomial. Ann. Combin. 1, 253–259 (1997)
Spencer J.: Balancing vectors in the max norm. Combinatorica 6, 55–65 (1986)
Tardos G.: Polynomial bound for a chip firing game on graphs. SIAM J. Discr. Math. 1, 397–398 (1988)
The second author gratefully acknowledges the support of a Harvard Mathematics Department Highbridge Fellowship.
About this article
Cite this article
Kominers, P.M., Kominers, S.D. A constant bound for the periods of parallel chip-firing games with many chips. Arch. Math. 95, 9–13 (2010). https://doi.org/10.1007/s00013-010-0129-x
Mathematics Subject Classification (2000)
- 68Q25 (Primary)
- 68Q80 (Secondary)
- Parallel chip-firing