Recurrent Rotor-Router Configurations
classification
🧮 math.CO
keywords
changesconfigurationsfinitegraphsinitialproverecurrentrotor
read the original abstract
We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.