Escape Rates for Rotor Walks in $\mathbb{Z}^d$

DOI10.1137/130908646zbMath1292.05236arXiv1301.3521OpenAlexW2107752052MaRDI QIDQ4979842

Laura Florescu, Shirshendu Ganguly, Lionel Levine, Yuval Peres

Publication date: 19 June 2014

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

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

zbMATH Keywords

recurrencetransienceGreen functionrandom walkodometer functionEulerian walker

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Deterministic network models in operations research (90B10) Processes in random environments (60K37) Random walks on graphs (05C81)

Related Items (9)

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 ⋮ Proportionate growth in patterns formed in the rotor-router model ⋮ Spiral structures in the rotor-router walk ⋮ 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

This page was built for publication: Escape Rates for Rotor Walks in $\mathbb{Z}^d$