A law of large numbers for the range of rotor walks on periodic trees

zbMATH Open1457.60132arXiv1805.11983MaRDI QIDQ5124159FDOQ5124159

Authors: Wilfried Huss, Ecaterina Sava 

Publication date: 17 September 2020

Abstract: The aim of the current work is to prove a law of large numbers for the range size of recurrent rotor walks with random initial configuration on a general class of trees, called periodic trees or directed covers of graphs.

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

Recommendations

• Range and speed of rotor walks on trees
• The range of a rotor walk
• Rotor walks on general trees
• Transience and recurrence of rotor-router walks on directed covers of graphs
• Rotor-routing on Galton-Watson trees

zbMATH Keywords

generating functionmultitype branching processspectral radiuslaw of large numbersrecurrencetransiencerotor walkrangeGalton-Watson treerate of escapeperiodic tree

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Strong limit theorems (60F15) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Random walks on graphs (05C81)

Cited In (3)

• Infinite-step stationarity of rotor walk and the wired spanning forest
• Limit theorems for discrete multitype branching processes counted with a characteristic
• The range of a rotor walk

This page was built for publication: A law of large numbers for the range of rotor walks on periodic trees

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