Rotor-routing on Galton-Watson trees

Ecaterina Sava-Huss, Wilfried Huss, Sebastian Müller

Research output: Contribution to journalArticleResearchpeer-review

Abstract

A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is routed to the neighbor the rotor is now pointing at. In the current work we make a step toward in understanding the behavior of rotor router walks on random trees. More precisely, we consider random i.i.d. initial configurations of rotors on Galton-Watson trees T, i.e. on a family tree arising from a Galton-Watson process, and give a classification in recurrence and transience for rotor-router walks on these trees.
Original languageEnglish
Article number49
Number of pages12
JournalElectronic Communications in Probability
Volume20
Publication statusPublished - 2015

Fingerprint

Galton-Watson Tree
Rotor
Routing
Router
Walk
Transience
Galton-Watson Process
Random Trees
Vertex of a graph
Recurrence
Configuration
Graph in graph theory

Cite this

Rotor-routing on Galton-Watson trees. / Sava-Huss, Ecaterina; Huss, Wilfried; Müller, Sebastian.

In: Electronic Communications in Probability, Vol. 20, 49, 2015.

Research output: Contribution to journalArticleResearchpeer-review

Sava-Huss, Ecaterina ; Huss, Wilfried ; Müller, Sebastian. / Rotor-routing on Galton-Watson trees. In: Electronic Communications in Probability. 2015 ; Vol. 20.
@article{84b5eb4390fc4e4dbb05fadb3dcb9193,
title = "Rotor-routing on Galton-Watson trees",
abstract = "A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is routed to the neighbor the rotor is now pointing at. In the current work we make a step toward in understanding the behavior of rotor router walks on random trees. More precisely, we consider random i.i.d. initial configurations of rotors on Galton-Watson trees T, i.e. on a family tree arising from a Galton-Watson process, and give a classification in recurrence and transience for rotor-router walks on these trees.",
author = "Ecaterina Sava-Huss and Wilfried Huss and Sebastian M{\"u}ller",
year = "2015",
language = "English",
volume = "20",
journal = "Electronic Communications in Probability",
issn = "1083-589X",
publisher = "Institute of Mathematical Statistics",

}

TY - JOUR

T1 - Rotor-routing on Galton-Watson trees

AU - Sava-Huss, Ecaterina

AU - Huss, Wilfried

AU - Müller, Sebastian

PY - 2015

Y1 - 2015

N2 - A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is routed to the neighbor the rotor is now pointing at. In the current work we make a step toward in understanding the behavior of rotor router walks on random trees. More precisely, we consider random i.i.d. initial configurations of rotors on Galton-Watson trees T, i.e. on a family tree arising from a Galton-Watson process, and give a classification in recurrence and transience for rotor-router walks on these trees.

AB - A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is routed to the neighbor the rotor is now pointing at. In the current work we make a step toward in understanding the behavior of rotor router walks on random trees. More precisely, we consider random i.i.d. initial configurations of rotors on Galton-Watson trees T, i.e. on a family tree arising from a Galton-Watson process, and give a classification in recurrence and transience for rotor-router walks on these trees.

M3 - Article

VL - 20

JO - Electronic Communications in Probability

JF - Electronic Communications in Probability

SN - 1083-589X

M1 - 49

ER -