Recurrent rotor-router configurations

DOI10.4310/JOC.2012.V3.N2.A3MaRDI QIDQ1937353zbMATH OpenOpenAlexFDO

Authors Omer Angel, A. E. Holroyd

Publication date 28 February 2013

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.2484

zbMATH Keywords

quasi-randomrecurrencerotor walkrotor-router

Mathematics Subject Classification ID

Random walks on graphs (05C81) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Abstract: We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under changes in the starting vertex and finite changes in the initial configuration.

Recommendations

• Transience and recurrence of rotor-router walks on directed covers of graphs
• Escape rates for rotor walks in \(\mathbb{Z}^d\)
• Infinite excursions of router walks on regular trees
• Rotor-routing on Galton-Watson trees
• The rotor-router model on regular trees

Cited in

(16)

• A rotor configuration with maximum escape rate
• Erratum to: ``Transience and recurrence of rotor-router walks on directed covers of graphs
• The rotor-router shape is spherical
• Local-to-global principles for the hitting sequence of a rotor walk
• Transience and recurrence of rotor-router walks on directed covers of graphs
• The range of a rotor walk
• Escape rates for rotor walks in \(\mathbb{Z}^d\)
• Infinite-step stationarity of rotor walk and the wired spanning forest
• Rotor walks on transient graphs and the wired spanning forest
• Infinite excursions of router walks on regular trees
• A loop reversibility and subdiffusion of the rotor-router walk
• Recurrence of horizontal-vertical walks
• Rotor-router aggregation on the layered square lattice
• Random rotor walks and i.i.d. sandpiles on Sierpiński graphs
• Law of the iterated logarithm for \(p\)-walks on \(\mathbb{Z}\)
• Abelian networks. II: Halting on all inputs

This page was built for publication: Recurrent rotor-router configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937353)