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

preprint2014arXivOpen access

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ψ(1)=ψ'(1)=0 for which G. Faraud, Y. Hu and Z. Shi in \cite{HuShi10b} show that, with probability one, the largest generation visited by the walk, until the instant nn, is of the order of (log⁡n)3(\log n)^3. In \cite{AndreolettiDebs1} we prove that the largest generation entirely visited behaves almost surely like log⁡n\log n up to a constant. Here we study how the walk visits the generations ℓ=(log⁡n)1+ζ\ell=(\log n)^{1+ ζ}, with 0<ζ<20 < ζ<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)2(\log n)^2 for the mean of visited sites until nn returns to the root. Also we show that the visited sites spread all over the tree until generation ℓ\ell.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.