Recurrent Rotor-Router Configurations
Abstract
We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Zd, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under changes in the starting vertex and finite changes in the initial configuration.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.