2000 character limit reached
Genealogy in critical generations of a diffusive random walk in random environment on trees (2410.08402v2)
Published 10 Oct 2024 in math.PR
Abstract: We consider the range $R{(n)}$, the tree made up of visited vertices by a diffusive null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree $\mathbb{T}$ up to the $n$-th return time to its root and we consider the following genealogy problem: pick two vertices uniformly at random in a generation of order $n$ in the tree $R{(n)}$. Where does the coalescence occur? it turns out that the coalescence happens either in the recent past or in the remote past.
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.