2009
DOI: 10.21711/217504322009/em161
|View full text |Cite
|
Sign up to set email alerts
|

Recent progress in coalescent theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
157
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 135 publications
(158 citation statements)
references
References 133 publications
(242 reference statements)
1
157
0
Order By: Relevance
“…, n}) using a so-called Aldous' construction. We present its simplified version here in a form borrowed from [7], see Section 2.1.3 therein. Start with a chain of length n connecting the labeled vertices U 1 ,U 2 , .…”
Section: Random Compositions and Recordsmentioning
confidence: 99%
See 1 more Smart Citation
“…, n}) using a so-called Aldous' construction. We present its simplified version here in a form borrowed from [7], see Section 2.1.3 therein. Start with a chain of length n connecting the labeled vertices U 1 ,U 2 , .…”
Section: Random Compositions and Recordsmentioning
confidence: 99%
“…, n} an edge picked uniformly at random among existing n − k + 1 edges, results in a consistent (in k) family of random compositions given by the sizes of connected components counted from left to right. The number of blocks at time k (or in the k-th row) is k. According to Lemma 2.1 in [7], a composition obtained after removing k − 1 edges is uniformly distributed on the set of all partitions of n into k summands. Note that this construction is also consistent in n in the following sense.…”
Section: Random Compositions and Recordsmentioning
confidence: 99%
“…That is, i, j ∈ {1, .., m} are in the same block of π κ (t) if and only if U i κ and U j κ share an ancestor at time t. The coalescent tree is the partition-valued process (π κ (t)) t≥0 . Representing coalescent trees as partition-valued processes is standard [5].…”
Section: Coalescent Treementioning
confidence: 99%
“…The class of population models giving rise to Kingman's coalescent is nowhere near as wide as the world of biological populations. This is one reason why coalescent theory has continued to grow with exploration of a rich collection of population models and their coalescent trees [3,5]. Branching processes form a class of population models whose coalescent trees have been extensively studied [6,7,8,9,10,11,12,13,14].…”
Section: Introductionmentioning
confidence: 99%
“…The Bolthausen-Sznitman coalescent[40] is a process on the partitions of N, in which a proportion p of the blocks merge to a single one at rate p ´2 dp. See[26] and[24] for an introduction to coalescent processes.…”
mentioning
confidence: 99%