Spiral Structures in the Rotor-Router Walk
Abstract
We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors and labeled sites where the loops become closed. The sequence of labels in the rotor-router walk was conjectured to form a spiral structure obeying asymptotically an Archimedean property. In the present paper, we select a subset of labels called "nodes" and consider spirals formed by nodes. The new spirals are directly related to tree-like structures which represent the evolution of the cluster of vertices visited by the walk. We show that the average number of visits to the origin <n0(t)> by the moment t 1 is <n0(t)> = 4 <n(t)> + O(1) where <n(t)> is the average number of rotations of the spiral.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.