English

Spiral Structures in the Rotor-Router Walk

Probability 2016-06-27 v2 Statistical Mechanics Combinatorics

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)>\left<n_0(t)\right> by the moment t1t\gg 1 is <n0(t)>=4<n(t)>+O(1)\left<n_0(t)\right> = 4 \left<n(t)\right> + O(1) where <n(t)>\left<n(t)\right> is the average number of rotations of the spiral.

Keywords

Cite

@article{arxiv.1512.00280,
  title  = {Spiral Structures in the Rotor-Router Walk},
  author = {Vl. V. Papoyan and V. S. Poghosyan and V. B. Priezzhev},
  journal= {arXiv preprint arXiv:1512.00280},
  year   = {2016}
}

Comments

15 pages, 7 figures

R2 v1 2026-06-22T11:58:35.546Z