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

Ecaterina Sava-Huss (Graz University of Technology, Austria)
Wilfried Huss (Graz University of Technology, Austria)

Abstract


In the paper "Transience and recurrence of rotor-router walks on directed covers of graphs", published in ECP volume 17 (2012), no. 41 there is an error in the proof of Corollary 3.8. This corollary is essential for the transient part in the proof of Theorem 3.5(b). We fix this error by constructing a new rotor-router process, which fulfills our needs, and for which the statement of Corollary 3.8. holds.

Full Text: Download PDF | View PDF online (requires PDF plugin)

Pages: 1-6

Publication Date: October 10, 2014

DOI: 10.1214/ECP.v19-3848

References

  • Angel, Omer; Holroyd, Alexander E. Rotor walks on general trees. SIAM J. Discrete Math. 25 (2011), no. 1, 423--446. MR2801237
  • Angel, Omer; Holroyd, Alexander E. Recurrent rotor-router configurations. J. Comb. 3 (2012), no. 2, 185--194. MR2980749
  • 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. MR2681857
  • 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. MR2981897
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.