[1] Bond, B. and Levine, L. (2016) Abelian networks I: Foundations and examples. SIAM J. Discrete Math. 30 856–874.

[2] Bond, B. and Levine, L. (2016) Abelian networks II: Halting on all inputs. Selecta Math. 22 319–340.

[3] Bond, B. and Levine, L. (2016) Abelian networks III: The critical group. J. Alg. Combin. 43 635–663.

[4] Cairns, H. (2018) “Some halting problems for abelian sandpiles are undecidable in dimension three.” SIAM Journal on Discrete Mathematics **32.4** 2636–2666.

[5] Chan, M., Church, T. and Grochow, J. A. (2015) Rotor-routing and spanning trees on planar graphs. Int. Math. Res. Not. 2015 3225–3244.

[6] Cori, R. and Le Borgne, Y. (2013) The Riemann–Roch theorem for graphs and the rank in complete graphs. arXiv:1308.5325

[7] Dhar, D. (1990) Self-organized critical state of sandpile automaton models. Phys. Rev. Lett. 64 1613–1616.

[8] Dhar, D. (1999) The abelian sandpile and related models. Physica A 263 4–25.

[9] Dhar, D. (2006) Theoretical studies of self-organized criticality. Physica A 369 29–70.

[10] Diaconis, P. and Fulton, W. (1991) A growth model, a game, an algebra, Lagrange inversion, and characteristic classes. Rend. Sem. Mat. Univ. Pol. Torino, 49 95–119.

[11] Dickson, L. E. (1913) Finiteness of the odd perfect and primitive abundant numbers with *n* distinct prime factors. Amer. J. Math 35 413–422.

[12] Farrell, M. and Levine, L. (2016) CoEulerian graphs. Proc. Amer. Math. Soc. 144 2847–2860.

[13] Fey, A., Levine, L. and Peres, Y. (2010) Growth rates and explosions in sandpiles. J. Statist. Phys. 138 143–159.

[14] Friedrich, T. and Levine, L. (2013) Fast simulation of large-scale growth models. Random Struct. Alg. 42 185–213.

[15] Holroyd, A. E., Levine, L., Mészáros, K., Peres, Y., Propp, J. and Wilson, D. B. (2008) Chip-firing and rotor-routing on directed graphs. In In and Out of Equilibrium 2, Vol. 60 of Progress in Probability, Birkhäuser, pp. 331–364.

[16] Holroyd, A. E. and Propp, J. G. (2010) Rotor walks and Markov chains. In Algorithmic Probability and Combinatorics, Vol. 520 of Contemporary Mathematics, American Mathematical Society, pp. 105–126.

[17] Hujter, B., Kiss, V. and Tóthmérész, L. (2017) On the complexity of the chip-firing reachability problem. Proc. Amer. Math. Soc. 145 3343–3356.

[18] Kiss, V. and Tóthmérész, L. (2015) Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph. Discrete Appl. Math. 193 48–56.

[19] Levine, L. and Peres, Y. (2009) Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile. Potential Anal. 30 1–27.

[20] Mejía, C. and Montoya, J. A. (2011) On the complexity of sandpile critical avalanches. Theoret. Comput. Sci. 412 3964–3974.

[21] Montoya, J. A. and Mejía, C. (2009) On the complexity of sandpile prediction problems. Electron. Notes Theoret. Comput. Sci. 252 229–245.

[22] Moore, C. and Nilsson, M. (1999) The computational complexity of sandpiles. J. Statist. Phys. 96 205–224.

[23] Ostojic, S. (2003) Patterns formed by addition of grains to only one site of an abelian sandpile. Physica A 318 187–199.

[24] Perrot, K. and Van Pham, Trung (2015) Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs. Ann. Combin. 19 373–396.

[25] Sadhu, T. and Dhar, D. (2012) Pattern formation in fast-growing sandpiles. Phys. Rev. E 85 021107.

[26] Tardos, G. (1988) Polynomial bound for a chip firing game on graphs. SIAM J. Discrete Math. 1 397–398.