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 t≫1t\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.