  A rotor configuration on a graph contains in every vertex an infinite ordered
sequence of rotors, each is pointing to a neighbor of the vertex. After
sampling a configuration according to some probability measure, a rotor walk is
a deterministic process: at each step it chooses the next unused rotor in its
current location, and uses it to jump to the neighboring vertex to which it
points.
  Rotor walks capture many aspects of the expected behavior of simple random
walks. However, this similarity breaks down for the property of having an
infinite excursion. In this paper we study that question for natural random
configuration models on regular trees. Our results suggest that in this context
the rotor model behaves like the simple random walk unless it is not "close to"
the standard rotor-router model.
