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 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 , is of the order of . In \cite{AndreolettiDebs1} we prove that the largest generation entirely visited behaves almost surely like up to a constant. Here we study how the walk visits the generations , with . 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 for the mean of visited sites until returns to the root. Also we show that the visited sites spread all over the tree until generation .

生成讲解博客的中文版本

生成AI智能校验的中文版本