## Electronic Communications in Probability

### 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.

#### Article information

Source
Electron. Commun. Probab., Volume 20 (2015), paper no. 49, 12 pp.

Dates
Accepted: 29 June 2015
First available in Project Euclid: 7 June 2016

https://projecteuclid.org/euclid.ecp/1465320976

Digital Object Identifier
doi:10.1214/ECP.v20-4000

Mathematical Reviews number (MathSciNet)
MR3367899

Zentralblatt MATH identifier
1321.60177

Rights

#### Citation

Huss, Wilfried; Müller, Sebastian; Sava-Huss, Ecaterina. Rotor-routing on Galton-Watson trees. Electron. Commun. Probab. 20 (2015), paper no. 49, 12 pp. doi:10.1214/ECP.v20-4000. https://projecteuclid.org/euclid.ecp/1465320976

#### References

• Angel, Omer; Holroyd, Alexander E. Rotor walks on general trees. SIAM J. Discrete Math. 25 (2011), no. 1, 423–446.
• Angel, Omer; Holroyd, Alexander E. Recurrent rotor-router configurations. J. Comb. 3 (2012), no. 2, 185–194.
• Chen, Dayue; Peres, Yuval. Anchored expansion, percolation and speed. With an appendix by GÃ¡bor Pete. Ann. Probab. 32 (2004), no. 4, 2978–2995.
• Cooper, Joshua N.; Spencer, Joel. Simulating a random walk with constant error. Combin. Probab. Comput. 15 (2006), no. 6, 815–822.
• Diaconis, P.; Fulton, W. A growth model, a game, an algebra, Lagrange inversion, and characteristic classes. Commutative algebra and algebraic geometry, II (Italian) (Turin, 1990). Rend. Sem. Mat. Univ. Politec. Torino 49 (1991), no. 1, 95–119 (1993).
• Florescu, Laura; Ganguly, Shirshendu; Levine, Lionel; Peres, Yuval. Escape rates for rotor walks in $\Bbb{Z}^ d$. SIAM J. Discrete Math. 28 (2014), no. 1, 323–334.
• Friedrich, Tobias; Levine, Lionel. Fast simulation of large-scale growth models. Random Structures Algorithms 42 (2013), no. 2, 185–213.
• Holroyd, Alexander E.; Levine, Lionel; MészÃ¡ros, Karola; Peres, Yuval; Propp, James; Wilson, David B. Chip-firing and rotor-routing on directed graphs. In and out of equilibrium. 2, 331–364, Progr. Probab., 60, Birkhäuser, Basel, 2008.
• Holroyd, Alexander E.; Propp, James. Rotor walks and Markov chains. Algorithmic probability and combinatorics, 105–126, Contemp. Math., 520, Amer. Math. Soc., Providence, RI, 2010.
• Huss, Wilfried; Sava, Ecaterina. Transience and recurrence of rotor-router walks on directed covers of graphs. Electron. Commun. Probab. 17 (2012), no. 41, 13 pp.
• Huss, Wilfried; Sava-Huss, Ecaterina. Erratum: Transience and recurrence of rotor-router walks on directed covers of graphs [ ]. Electron. Commun. Probab. 19 (2014), no. 71, 6 pp.
• Landau, Itamar; Levine, Lionel. The rotor-router model on regular trees. J. Combin. Theory Ser. A 116 (2009), no. 2, 421–433.
• Lyons, Russell; Pemantle, Robin; Peres, Yuval. Unsolved problems concerning random walks on trees. Classical and modern branching processes (Minneapolis, MN, 1994), 223–237, IMA Vol. Math. Appl., 84, Springer, New York, 1997.
• Russel Lyons with Yuval Peres, Probability on Trees and Networks, Cambridge University Press, 2015. In preparation. Current version available at http://pages.iu.edu/~rdlyons.