The most visited sites of biased random walks on trees - Sorbonne Université Access content directly
Journal Articles Electronic Journal of Probability Year : 2015

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.
Fichier principal
Vignette du fichier
4051-21859-1-PB.pdf (318.36 Ko) Télécharger le fichier
Origin Publication funded by an institution
Loading...

Dates and versions

hal-01214677 , version 1 (12-10-2015)

Licence

Identifiers

Cite

Yueyun Hu, Zhan Shi. The most visited sites of biased random walks on trees. Electronic Journal of Probability, 2015, 20, pp.1-14. ⟨10.1214/EJP.v20-4051⟩. ⟨hal-01214677⟩
833 View
165 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More