Skip to Main content Skip to Navigation
Journal articles

The most visited sites of biased random walks on trees

Abstract : We consider the slow movement of randomly biased random walk (Xn) on a supercriti-cal Galton–Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of the distributions of the most visited sites under the annealed measure. This is in contrast with the one-dimensional case, and provides, to the best of our knowledge, the first non-trivial example of null recurrent random walk whose most visited sites are not transient, a question originally raised by Erd˝ os and Révész [11] for simple symmetric random walk on the line.
Document type :
Journal articles
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download
Contributor : Gestionnaire Hal-Upmc <>
Submitted on : Monday, October 12, 2015 - 5:54:53 PM
Last modification on : Tuesday, May 5, 2020 - 1:03:21 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:03:43 AM


Publication funded by an institution


Distributed under a Creative Commons Attribution 4.0 International License



Yueyun Hu, Zhan Shi. The most visited sites of biased random walks on trees. Electronic Journal of Probability, Institute of Mathematical Statistics (IMS), 2015, 20, pp.1-14. ⟨10.1214/EJP.v20-4051⟩. ⟨hal-01214677⟩



Record views


Files downloads