2000 character limit reached
A mixing tree-valued process arising under neutral evolution with recombination
Published 5 May 2015 in math.PR | (1505.01165v1)
Abstract: The genealogy at a single locus of a constant size $N$ population in equilibrium is given by the well-known Kingman's coalescent. When considering multiple loci under recombination, the ancestral recombination graph encodes the genealogies at all loci in one graph. For a continuous genome $G$, we study the tree-valued process $(TN_u)_{u\in G}$ of genealogies along the genome in the limit $N\to\infty$. Encoding trees as metric measure spaces, we show convergence to a tree-valued process with cadlag paths. In addition, we study mixing properties of the resulting process for loci which are far apart.
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.