2000 character limit reached
Local times in critical generations of a random walk in random environment on trees (2408.16955v3)
Published 30 Aug 2024 in math.PR
Abstract: We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of a stable continuous-state branching process. We also provide an explicit equivalent of the probability that critical generations are reached by the random walk $\mathbb{X}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.