The slow regime of randomly biased walks on trees
arXiv:1501.07700
Abstract
We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk is null recurrent, making a maximal displacement of order of magnitude in the first steps. We study the localization problem of and prove that the quenched law of can be approximated by a certain invariant probability depending on and the random environment. As a consequence, we establish that upon the survival of the system, converges in law to some non-degenerate limit on whose law is explicitly computed.
arXiv comment43 pages. We added a recent work by Jim Pitman ([38]) for the limiting law
References in corpus (7)
- Convergence in law of the minimum of a branching random walk
- Almost sure convergence for stochastically biased random walks on trees
- Large deviations for random walks in random environment on a Galton-Watson tree
- The maximal potential energy of biased random walks on trees
- The maximal drawdown of the Brownian meander
- First order transition for the branching random walk at the critical parameter
- The most visited sites of biased random walks on trees