  Rotor walk is a deterministic analogue of simple random walk. For any given
graph, we construct a rotor configuration for which the escape rate of the
corresponding rotor walk is equal to the escape rate of simple random walk, and
thus answer a question of Florescu, Ganguly, Levine, and Peres (2014).
