Transience and recurrence of rotor-router walks on directed covers of graphs
classification
🧮 math.CO
math.PR
keywords
directedrotor-routertreescoversgraphsperiodicrecurrencetransience
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.