A classification of coalescent processes for haploid exchangeable population models

153Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

Abstract

We consider a class of haploid population models with nonoverlapping generations and fixed population size N assuming that the family sizes within a generation are exchangeable random variables. A weak convergence criterion is established for a properly scaled ancestral process as N → ∞. It results in a full classification of the coalescent generators in the case of exchangeable reproduction. In general the coalescent process allows for simultaneous multiple mergers of ancestral lines.

References Powered by Scopus

The coalescent

1982Citations
N/AReaders
Get full text

Coalescents with multiple collisions

348Citations
N/AReaders
Get full text

Coalescents and genealogical structure under neutrality

289Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Branching processes: Variation, growth, and extinction of populations

387Citations
N/AReaders
Get full text

Coalescent processes when the distribution of offspring number among individuals is highly skewed

180Citations
N/AReaders
Get full text

Efficient ancestry and mutation simulation with msprime 1.0

122Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Möhle, M., & Sagitov, S. (2001). A classification of coalescent processes for haploid exchangeable population models. Annals of Probability, 29(4), 1547–1562. https://doi.org/10.1214/aop/1015345761

Readers over time

‘10‘12‘13‘14‘15‘16‘18‘19‘20‘21‘22‘23‘24‘2502468

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 13

45%

Professor / Associate Prof. 8

28%

Researcher 7

24%

Lecturer / Post doc 1

3%

Readers' Discipline

Tooltip

Agricultural and Biological Sciences 11

44%

Mathematics 9

36%

Medicine and Dentistry 3

12%

Computer Science 2

8%

Save time finding and organizing research with Mendeley

Sign up for free
0