Spread of visited sites of a random walk along the generations of a branching process

2013/03/13 by Andreoletti, Pierre, Debs, Pierre
#FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.1303.3199

Abstract

In this paper we consider a null recurrent random walk in random environment on a super-critical Galton-Watson tree. We consider the case where the log-Laplace transform ψ of the branching process satisfies ψ(1)=ψ'(1)=0 for which G. Faraud, Y. Hu and Z. Shi in \citeHuShi10b show that, with probability one, the largest generation visited by the walk, until the instant n, is of the order of (log n)³. In \citeAndreolettiDebs1 we prove that the largest generation entirely visited behaves almost surely like log n up to a constant. Here we study how the walk visits the generations ℓ=(log n)^{1+ ζ}, with 0 < ζ<2. We obtain results in probability giving the asymptotic logarithmic behavior of the number of visited sites at a given generation. We prove that there is a phase transition at generation (log n)² for the mean of visited sites until n returns to the root. Also we show that the visited sites spread all over the tree until generation ℓ.

Related

• Range and critical generations of a random walk on Galton-Watson trees
• The number of generations entirely visited for recurrent random walks on random environment
• Branching random walks and contact processes on Galton-Watson trees
• Local times in critical generations of a random walk in random environment on trees
• Random walk on barely supercritical branching random walk