Journal article
Convergence of genealogies through spinal decomposition with an application to population genetics
- Abstract:
- Abstract Consider a branching Markov process with values in some general type space. Conditional on survival up to generation N , the genealogy of the extant population defines a random marked metric measure space, where individuals are marked by their type and pairwise distances are measured by the time to the most recent common ancestor. In the present manuscript, we devise a general method of moments to prove convergence of such genealogies in the Gromov-weak topology when $$N \rightarrow \infty $$ N → ∞ . Informally, the moment of order k of the population is obtained by observing the genealogy of k individuals chosen uniformly at random after size-biasing the population at time N by its k th factorial moment. We show that the sampled genealogy can be expressed in terms of a k -spine decomposition of the original branching process, and that convergence reduces to the convergence of the underlying k -spines. As an illustration of our framework, we analyse the large-time behavior of a branching approximation of the biparental Wright–Fisher model with recombination. The model exhibits some interesting mathematical features. It starts in a supercritical state but is naturally driven to criticality. We show that the limiting behavior exhibits both critical and supercritical characteristics.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 751.0KB, Terms of use)
-
- Publisher copy:
- 10.1007/s00440-023-01223-7
Authors
- Publisher:
- Springer
- Journal:
- Probability Theory and Related Fields More from this journal
- Volume:
- 187
- Issue:
- 3-4
- Pages:
- 697-751
- Publication date:
- 2023-08-18
- DOI:
- EISSN:
-
1432-2064
- ISSN:
-
0178-8051
- Language:
-
English
- Keywords:
- Pubs id:
-
1521536
- Local pid:
-
pubs:1521536
- Source identifiers:
-
W4385994909
- Deposit date:
-
2026-05-12
- ARK identifier:
This ORA record was generated from metadata provided by an external service. It has not been edited by the ORA Team.
Terms of use
- Copyright date:
- 2023
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record