Journal of Combinatorics
Volume 3 (2012)
Recurrent rotor-router configurations
Pages: 185 – 194
We prove the existence of recurrent initial configurations for therotor walk on many graphs, including $Z^d$, and planar graphs withlocally finite embeddings. We also prove that recurrence andtransience of rotor walks are invariant under changes in the startingvertex and finite changes in the initial configuration.
rotor walk, rotor-router, quasi-random, recurrence
2010 Mathematics Subject Classification