Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 89 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 39 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 119 tok/s Pro
Kimi K2 188 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Spread of visited sites of a random walk along the generations of a branching process (1303.3199v3)

Published 13 Mar 2013 in math.PR

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 $\psi$ of the branching process satisfies $\psi(1)=\psi'(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 $n$, is of the order of $(\log n)3$. In \cite{AndreolettiDebs1} 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 $\ell=(\log n){1+ \zeta}$, with $0 < \zeta <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$ 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 $\ell$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.