Biased random walks on Galton-Watson trees with leaves

From MaRDI portal
Publication:662434

DOI10.1214/10-AOP620zbMATH Open1239.60091arXiv0711.3686MaRDI QIDQ662434FDOQ662434


Authors: Gerard Ben Arous, Alexander Fribergh, Nina Gantert, Alan Hammond Edit this on Wikidata


Publication date: 22 February 2012

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We consider a biased random walk Xn on a Galton-Watson tree with leaves in the sub-ballistic regime. We prove that there exists an explicit constant , depending on the bias , such that Xn is of order ngamma. Denoting Deltan the hitting time of level n, we prove that Deltan/n1/gamma is tight. Moreover we show that Deltan/n1/gamma does not converge in law (at least for large values of ). We prove that along the sequences , Deltan/n1/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.


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




Recommendations




Cites Work


Cited In (42)





This page was built for publication: Biased random walks on Galton-Watson trees with leaves

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