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.
Type de document :
Article dans une revue
Electronic Journal of Probability, Institute of Mathematical Statistics (IMS), 2015, 20, pp.1-14. <10.1214/EJP.v20-4051>
Liste complète des métadonnées

http://hal.upmc.fr/hal-01214677
Contributeur : Gestionnaire Hal-Upmc <>
Soumis le : lundi 12 octobre 2015 - 17:54:53
Dernière modification le : mardi 11 octobre 2016 - 15:20:17

Fichier

4051-21859-1-PB.pdf
Publication financée par une institution

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

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>

Partager

Métriques

Consultations de
la notice

160

Téléchargements du document

49