2000 character limit reached
The genealogy of Galton-Watson trees
Published 25 Sep 2017 in math.PR | (1709.08500v5)
Abstract: Take a continuous-time Galton-Watson tree and pick $k$ distinct particles uniformly from those alive at a time $T$. What does their genealogical tree look like? The case $k=2$ has been studied by several authors, and the near-critical asymptotics for general $k$ appear in Harris, Johnston and Roberts (2018). Here we give the full picture.
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.