The most visited sites of biased random walks on trees

DOI10.1214/EJP.V20-4051MaRDI QIDQ2515929zbMATH OpenFDO

Authors Zhan Shi, Yueyun Hu

Publication date 7 August 2015

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.02831

zbMATH Keywords

biased random walkbranching random walkGalton-Watson treelocal timemost visited sites

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Processes in random environments (60K37)

Abstract: We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical 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 ErdH{o}s and R'ev'esz [11] for simple symmetric random walk on the line.

Recommendations

• Favorite sites of randomly biased walks on a supercritical Galton-Watson tree
• Recent progress in biased random walks on trees
• The slow regime of randomly biased walks on trees
• Almost sure convergence for stochastically biased random walks on trees
• Biased random walks on Galton-Watson trees

Cited in

(9)

• On uniform closeness of local times of Markov chains and i.i.d. sequences
• Range and critical generations of a random walk on Galton-Watson trees
• Favorite sites of randomly biased walks on a supercritical Galton-Watson tree
• Three favorite sites occurs infinitely often for one-dimensional simple random walk
• Heavy range of the randomly biased walk on Galton-Watson trees in the slow movement regime
• Spread of visited sites of a random walk along the generations of a branching process
• Recent progress in biased random walks on trees
• An invariance principle and a large deviation principle for the biased random walk on \(\mathbb{Z}^d\)
• Three favorite edges occurs infinitely often for one-dimensional simple random walk

This page was built for publication: The most visited sites of biased random walks on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515929)