Local-to-global principles for rotor walk

G. F. Lawler, A self-avoiding random walk, Duke Math. J. 47

1980

Earlier work this paper cites.

D. Dhar, Self-organized critical state of sandpile automaton models, Phys. Rev. Lett

1990

Earlier work this paper cites.

P. Diaconis and W. 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.

K. Eriksson, Strong convergence and a game of numbers, European J. Combin. 17

1996

Earlier work this paper cites.

V. B. Priezzhev, D. Dhar, A. Dhar and S. Krishnamurthy. Eulerian walkers as a model of self-organized criticality. Phys. Rev. Lett

1996

Earlier work this paper cites.

D. B. Wilson, Generating random spanning trees more quickly than the cover time, In 28th Annual ACM Symposium on the Theory of Computing (STOC ’96) , 296–303, 1996

1996

Earlier work this paper cites.

C. Kimberling, Fractal sequences and interspersions, Ars Combin. 45

1997

Cited alongside, same era.

J. N. Cooper and J. Spencer, Simulating a random walk with constant error, Combin. Probab. Comput. 15

2006

Cited alongside, same era.

D. Dhar, Theoretical studies of self-organized criticality, Physica A 369

2006

Cited alongside, same era.

A. E. Holroyd, L. Levine, K. Mészáros, Y. Peres, J. Propp and D. B. Wilson, Chip-firing and rotor-routing on directed graphs, In and out of equilibrium 2 , 331–364, Progr. Probab. 60

Original

2008

Cited alongside, same era.

I. Landau and L. Levine, The rotor-router model on regular trees, J. Comb. Theory A (2009) 116: 421–433. arXiv:0705.1562

Original

2009

Cited alongside, same era.

L. Babai and E. Toumpakari, A structure theory of the sandpile monoid for directed graphs, 2010. http://people.cs.uchicago.edu/~laci/REU10/evelin.pdf

2010

Later among the works it cites.

A. E. Holroyd and J. Propp, Rotor walks and Markov chains, In Algorithmic Probability and Combinatorics , American Mathematical Society, 2010. arXiv:0904.4507

Original

2010

Later among the works it cites.

O. Angel and A. E. Holroyd, Rotor walks on general trees, SIAM J. Discrete Math. 25

Original

2011

Closest in time.

B. Bond and L. Levine, Abelian networks I. Foundations and examples, 2011

2011

Closest in time.

J. Propp, Rotor walk: Examples and perspectives, 2011

2011

Closest in time.