Rotor Walks on General Trees

DOI10.1137/100814299zbMath1252.05032arXiv1009.4802OpenAlexW2149071580MaRDI QIDQ3094920

Alexander E. Holroyd, Omer Angel

Publication date: 27 October 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

branching processinfinite treerotor-routerrotor walkquasi-random

Mathematics Subject Classification ID

Trees (05C05) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Random walks on graphs (05C81)

Related Items (8)

The Range of a Rotor Walk ⋮ A rotor configuration with maximum escape rate ⋮ Recurrence of horizontal-vertical walks ⋮ Abelian networks. II: Halting on all inputs ⋮ Infinite excursions of router walks on regular trees ⋮ Rotor Walks on Transient Graphs and the Wired Spanning Forest ⋮ Infinite-step stationarity of rotor walk and the wired spanning forest ⋮ Range and speed of rotor walks on trees

This page was built for publication: Rotor Walks on General Trees