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.
Domains
Statistics [math.ST]| Origin | Publication funded by an institution |
|---|
Loading...
