1Aix Marseille Univ CNRS, Centrale Marseille I2M Marseille 2Universitaet zu Berlin Institut fuer Mathematik Berlin and Technische Universitaet Berlin Institut fuer Mathematik Berlin
The electronic journal of combinatorics, Tome 24 (2017) no. 2
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a deterministic process: at each step it chooses the next unused rotor in its current location, and uses it to jump to the neighboring vertex to which it points. Rotor walks capture many aspects of the expected behavior of simple random walks. However, this similarity breaks down for the property of having an infinite excursion. In this paper we study that question for natural random configuration models on regular trees. Our results suggest that in this context the rotor model behaves like the simple random walk unless it is not "close to" the standard rotor-router model.
1
Aix Marseille Univ
CNRS, Centrale Marseille
I2M
Marseille
2
Universitaet zu Berlin
Institut fuer Mathematik
Berlin
and
Technische Universitaet Berlin
Institut fuer Mathematik
Berlin
@article{10_37236_5781,
author = {Sebastian M\"uller and Tal Orenshtein},
title = {Infinite excursions of router walks on regular trees},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {2},
doi = {10.37236/5781},
zbl = {1361.05121},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5781/}
}
TY - JOUR
AU - Sebastian Müller
AU - Tal Orenshtein
TI - Infinite excursions of router walks on regular trees
JO - The electronic journal of combinatorics
PY - 2017
VL - 24
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/5781/
DO - 10.37236/5781
ID - 10_37236_5781
ER -
%0 Journal Article
%A Sebastian Müller
%A Tal Orenshtein
%T Infinite excursions of router walks on regular trees
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/5781/
%R 10.37236/5781
%F 10_37236_5781
Sebastian Müller; Tal Orenshtein. Infinite excursions of router walks on regular trees. The electronic journal of combinatorics, Tome 24 (2017) no. 2. doi: 10.37236/5781
