Spiral structures in the rotor-router walk
From MaRDI portal
Publication:3302602
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 by the moment is where is the average number of rotations of the spiral.
Recommendations
Cites work
- A loop reversibility and subdiffusion of the rotor-router walk
- Chip-Firing and Rotor-Routing on Directed Graphs
- Escape rates for rotor walks in \(\mathbb{Z}^d\)
- Rotor walks and Markov chains
- Rotor-routing and spanning trees on planar graphs
- Self-organized critical state of sandpile automaton models
- Simulating a Random Walk with Constant Error
- Spherical asymptotics for the rotor-router model in $\mathbb{Z}^d$
- Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
- The rotor-router shape is spherical
- Transience and recurrence of rotor-router walks on directed covers of graphs
Cited in
(3)
This page was built for publication: Spiral structures in the rotor-router walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302602)