Transience and recurrence of rotor-router walks on directed covers of graphs

DOI10.1214/ECP.V17-2096MaRDI QIDQ456272zbMATH OpenFDO

Authors Wilfried Huss, Ecaterina Sava

Publication date 23 October 2012

Published in Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

directed coversgraphsmultitype branching processrecurrencerotor-router walkstransience

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random walks on graphs (05C81) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Abstract: The aim of this note is to extend the result of Angel and Holroyd concerning the transience and the recurrence of transfinite rotor-router walks, for random initial configuration of rotors on homogeneous trees. We address the same question on directed covers of finite graphs, which are also called trees with finitely many cone types or periodic trees. Furthermore, we provide an example of a directed cover such that the rotor-router walk can be either recurrent or transient, depending only on the planar embedding of the periodic tree.

Recommendations

• The rotor-router group of directed covers of graphs
• Recurrent rotor-router configurations
• Rotor-routing on Galton-Watson trees
• Erratum to: ``Transience and recurrence of rotor-router walks on directed covers of graphs
• The range of a rotor walk

Cited in

(11)

• Recurrent rotor-router configurations
• Erratum to: ``Transience and recurrence of rotor-router walks on directed covers of graphs
• Spiral structures in the rotor-router walk
• The rotor-router group of directed covers of graphs
• The range of a rotor walk
• A law of large numbers for the range of rotor walks on periodic trees
• Rotor walks on transient graphs and the wired spanning forest
• Infinite excursions of router walks on regular trees
• Recurrence of horizontal-vertical walks
• Random walks on directed covers of graphs
• Random rotor walks and i.i.d. sandpiles on Sierpiński graphs

This page was built for publication: Transience and recurrence of rotor-router walks on directed covers of graphs

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