A rotor router walk is a deterministic walk on a graph, where the exits from each vertex follow a fixed cyclic order. We prove a necessary and sufficient condition for recurrence of rotor router walks on supercritical Galton-Watson trees, in the case where the first exit of each vertex is choosen at random.
Joint work with Sebastian Müller and Ecaterina Sava-Huss.