Fetching the paper…
Reading the bibliography…
In Deepak Dhar's model of abelian distributed processors, automata occupy the vertices of a graph and communicate via the edges.
Kenneth Krohn and John Rhodes, Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines, Trans. Amer. Math. Soc. 116
1965
Earlier work this paper cites.
Kenneth Krohn and John Rhodes, Complexity of finite semigroups, Ann. Math. 88
1968
Earlier work this paper cites.
Christos H. Papadimitriou, On the complexity of integer programming, Journal of the ACM 28
1981
Earlier work this paper cites.
Per Bak, Chao Tang and Kurt Wiesenfeld, Self-organized criticality: an explanation of the 1 / f 1/f noise, Phys. Rev. Lett
1987
Earlier work this paper cites.
Aernout C. D. van Enter, Proof of Straley’s argument for bootstrap percolation. J. Stat. Phys. 48
1987
Earlier work this paper cites.
Deepak Dhar, Self-organized critical state of sandpile automaton models, Phys. Rev. Lett
1990
Earlier work this paper cites.
Shahar Mozes, Reflection processes on graphs and Weyl groups, J. Comb. Theory A 53
1990
Earlier work this paper cites.
Paul Tseng, Distributed computation for linear programming problems satisfying a certain diagonal dominance condition, Mathematics of Operations Research 15
1990
Earlier work this paper cites.
Anders Björner, László Lovász and Peter Shor, Chip-firing games on graphs, European J. Combin
1991
Earlier work this paper cites.
Persi Diaconis and William Fulton, A growth model, a game, an algebra, Lagrange inversion, and characteristic classes, Rend. Sem. Mat. Univ. Pol. Torino
1991
Earlier work this paper cites.
S. S. Manna, Two-state model of self-organized criticality, J. Phys. A: Math. Gen. 24
1991
Earlier work this paper cites.
Vidar Frette, Sandpile models with dynamically varying critical slopes, Phys. Rev. Lett. 70
1993
Earlier work this paper cites.
Andrei Gabrielov, Asymmetric abelian avalanches and sandpiles. Preprint, 1994. http://www.math.purdue.edu/~agabriel/asym.pdf
1994
Earlier work this paper cites.
Kimmo Eriksson, Chip-firing games on mutating graphs, SIAM J. Discrete Math. 9
1996
Earlier work this paper cites.
V. B. Priezzhev, Deepak Dhar, Abhishek Dhar and Supriya Krishnamurthy, Eulerian walkers as a model of self-organised criticality, Phys. Rev. Lett. 77
1996
Earlier work this paper cites.
Israel A. Wagner, Michael Lindenbaum and Alfred M. Bruckstein, Smell as a computational resource — a lesson we can learn from the ant, 4th Israeli Symposium on Theory of Computing and Systems , pages 219–230, 1996
1996
Earlier work this paper cites.
David B. Wilson, Generating random spanning trees more quickly than the cover time, 28th Annual ACM Symposium on the Theory of Computing (STOC ’96) , pages 296–303, 1996
1996
Earlier work this paper cites.
Norman L. Biggs and Peter Winkler, Chip-firing and the chromatic polynomial. Technical Report LSE-CDAM-97-03, London School of Economics, Center for Discrete and Applicable Mathematics, 1997
1997
Earlier work this paper cites.
Eric Goles and Maurice Margenstern, Universality of the chip-firing game, Theoret. Comp. Sci. 172
1997
Earlier work this paper cites.
Norman L. Biggs, Chip-firing and the critical group of a graph, J. Algebraic Combin. 9
1999
Earlier work this paper cites.
Deepak Dhar, The abelian sandpile and related models, Physica A 263
1999
Earlier work this paper cites.
Deepak Dhar, Studying self-organized criticality with exactly solved models, 1999. arXiv:cond-mat/9909009
1999
Cited alongside, same era.
Deepak Dhar, Some results and a conjecture for Manna’s stochastic sandpile model, Physica A 270
1999
Cited alongside, same era.
Cristopher Moore and Martin Nilsson. The computational complexity of sandpiles. J. Stat. Phys. 96
1999
Cited alongside, same era.
Eric Goles and Erich Prisner, Source reversal and chip firing on graphs, Theoret. Comp. Sci. 233
2000
Cited alongside, same era.
Itai Benjamini and David B. Wilson, Excited random walk, Elect. Comm. Probab. 8
2003
Cited alongside, same era.
Robert Cori and Yvan Le Borgne. The sand-pile model and Tutte polynomials. Adv. in Appl. Math. 30
2009
Later among the works it cites.
2009
Later among the works it cites.
2009
Later among the works it cites.
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
Alexander E. Holroyd, Sharp metastability threshold for two-dimensional bootstrap percolation, Probab. Theory Related Fields , 125
2003
Cited alongside, same era.
Srdjan Ostojic, Patterns formed by addition of grains to only one site of an abelian sandpile, Physica A 318
2003
Cited alongside, same era.
James Propp, Random walk and random aggregation, derandomized, 2003. http://research.microsoft.com/apps/video/default.aspx?id=104906
2003
Cited alongside, same era.
Arnoud Dartois and Dominique Rossin, Height-arrow model, Formal Power Series and Algebraic Combinatorics , 2004
2004
Cited alongside, same era.
Alexander Postnikov and Boris Shapiro, Trees, parking functions, syzygies, and deformations of monomial ideals. Trans. Amer. Math. Soc. 356
2004
Cited alongside, same era.
Denis Chebikin and Pavlo Pylyavskyy, A family of bijections between G G -parking functions and spanning trees, J. Combin. Theory A 110
2005
Cited alongside, same era.
2010
Later among the works it cites.
2010
Later among the works it cites.
2010
Later among the works it cites.
James Propp, Discrete analog computing with rotor-routers. Chaos 20
2010
Later among the works it cites.
Wilfried Huss and Ecaterina Sava, Rotor-router aggregation on the comb, Electr. J. Combin. 18
2011
Later among the works it cites.
Juan Andres Montoya and Carolina Mejia, The computational complexity of the abelian sandpile model, 2011. http://matematicas.uis.edu.co/jmontoya/sites/default/files/notas-ASM.pdf
2011
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
2013
Closest in time.
2013
Closest in time.
2014
Closest in time.
2014
Closest in time.
Igor Gorodezky and Igor Pak, Generalized loop-erased random walks and approximate reachability, Random Struct. Alg. 44
2014
Closest in time.
2014
Closest in time.