Infinite-step stationarity of rotor walk and the wired spanning forest

Abstract

We study rotor walk, a deterministic counterpart of the simple random walk, on infinite transient graphs. We show that the final rotor configuration of the rotor walk follows the law of the wired uniform spanning forest oriented toward infinity (OWUSF) measure when the initial rotor configuration is sampled from OWUSF. This result holds for all graphs for which each tree in the wired spanning forest has one single end almost surely. This answers a question posed in a previous work of the author (Chan 2018).

arXiv comment14 pages. Following the suggestion of the anonymous referee, we add the proofs to Lemma 4.2 and Lemma 4.3. Other changes are minor