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

DOI10.1214/ECP.V17-2096zbMath1252.05035arXiv1203.1477MaRDI QIDQ456272

Wilfried Huss, Ecaterina Sava-Huss

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

recurrencegraphstransiencemultitype branching processdirected coversrotor-router walks

Mathematics Subject Classification ID

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

Related Items (3)

Recurrence of horizontal-vertical walks ⋮ Spiral structures in the rotor-router walk ⋮ Infinite excursions of router walks on regular trees

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