Rotor walks on transient graphs and the wired spanning forest
arXiv:1809.09790 · doi:10.1137/18M1217139
Abstract
We study rotor walks on transient graphs with initial rotor configuration sampled from the oriented wired uniform spanning forest (OWUSF) measure. We show that the expected number of visits to any vertex by the rotor walk is at most equal to the expected number of visits by the simple random walk. In particular, this implies that this walk is transient. When these two numbers coincide, we show that the rotor configuration at the end of the process also has the law of OWUSF. Furthermore, if the graph is vertex-transitive, we show that the average number of visits by consecutive rotor walks converges to the Green function of the simple random walk as tends to infinity. This answers a question posed by Florescu, Ganguly, Levine, and Peres (2014).
arXiv comment32 pages, 3 figures
References in corpus (8)
- Eulerian Walkers as a model of Self-Organised Criticality
- Chip-Firing and Rotor-Routing on Directed Graphs
- Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile
- The Rotor-Router Model on Regular Trees
- Abelian networks IV. Dynamics of nonhalting networks
- Random walks with local memory
- Solution manifold and Its Statistical Applications
- A rotor configuration in Z^d where Schramm's bound of escape rates attains