Genealogy in critical generations of a diffusive random walk in random environment on trees
Abstract
We consider the range R(n), the tree made up of visited vertices by a diffusive null-recurrent randomly biased walk X on a Galton-Watson tree 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.