Biased random walks on a Galton-Watson tree with leaves

Details Biased random walks on a Galton-Watson tree with leaves Biased random walks on a Galton-Watson tree with leaves

2007-11-23

arxiv.org/abs/0711.3686v4

Mathematics

Probability

49 pages, 2 figures. To appear in Ann. Probab

Scientific paper

We consider a biased random walk $X_n$ on a Galton-Watson tree with leaves in the sub-ballistic regime. We prove that there exists an explicit constant $\gamma= \gamma(\beta) \in (0,1)$, depending on the bias $\beta$, such that $X_n$ is of order $n^{\gamma}$. Denoting $\Delta_n$ the hitting time of level $n$, we prove that $\Delta_n/n^{1/\gamma}$ is tight. Moreover we show that $\Delta_n/n^{1/\gamma}$ does not converge in law (at least for large values of $\beta$). We prove that along the sequences $n_{\lambda}(k)=\lfloor \lambda \beta^{\gamma k}\rfloor$, $\Delta_n/n^{1/\gamma}$ converges to certain infinitely divisible laws. Key tools for the proof are the classical Harris decomposition for Galton-Watson trees, a new variant of regeneration times and the careful analysis of triangular arrays of i.i.d. heavy-tailed random variables.

Affiliated with

Also associated with

No associations

Rating

Biased random walks on a Galton-Watson tree with leaves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Biased random walks on a Galton-Watson tree with leaves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Biased random walks on a Galton-Watson tree with leaves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363190