2017
DOI: 10.1016/j.spa.2016.06.019
|View full text |Cite
|
Sign up to set email alerts
|

Common ancestor type distribution: A Moran model and its deterministic limit

Abstract: We study the common ancestor type distribution in a 2-type Moran model with population size N , mutation and selection, and in the deterministic limit regime arising in the former when N tends to infinity, without any rescaling of parameters or time. In the finite case, we express the common ancestor type distribution as a weighted sum of combinatorial terms, and we show that the latter converges to an explicit function. Next, we recover the previous results through pruning of the ancestral selection graph (AS… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(34 citation statements)
references
References 19 publications
0
34
0
Order By: Relevance
“…For the case 1/2 < b < 1, Theorem 3. 5 gives an affirmative answer for subclasses of Cannings models admitting a paintbox representation, and in particular also for the Wright-Fisher model with selection. In Theorem 3.5a) we prove Haldane's formula under the condition…”
Section: Introductionmentioning
confidence: 92%
“…For the case 1/2 < b < 1, Theorem 3. 5 gives an affirmative answer for subclasses of Cannings models admitting a paintbox representation, and in particular also for the Wright-Fisher model with selection. In Theorem 3.5a) we prove Haldane's formula under the condition…”
Section: Introductionmentioning
confidence: 92%
“…Backward in time potential ancestors of a sample of the population are traced back with the help of the ASG. An appropriate dynamical ordering and pruning of its lines leads to the pruned lookdown ASG, which in turn permits to characterise the common ancestor type distribution (see [10]). The block counting process L N := (L N t ) t≥0 of the pruned lookdown ASG describes the number of potential ancestors of a given sample of individuals.…”
Section: Preliminaries: Fearnhead-type Recursionsmentioning
confidence: 99%
“…Let L N ∞ be a random variable distributed according to (p N n ) n∈ [N ] . The stationary tail probabilities a N n := P (L N ∞ > n), n ∈ [N − 1] 0 , are characterised by the recurrence relation (see [10,Prop. 4.7])…”
Section: Preliminaries: Fearnhead-type Recursionsmentioning
confidence: 99%
“…In the diffusion limit [36], one is left with branching events (at rate σ per line), coalescence events (at rate 1 per pair of lines), and mutation events (at rate ϑ ν 0 and ϑ ν 1 per line, respectively). In the deterministic limit [12], one loses the coalescence events, so that only branching (rate s per line) and mutation (rate uν 0 and uν 1 per line) survive. In the diffusion limit, the number of lines in the graph always remains finite (with probability 1), whereas it diverges in the deterministic limit as time tends to infinity (for any s > 0).…”
Section: The Ancestral Selection Graphmentioning
confidence: 99%
“…We are particularly interested in the limit t → ∞, that is, in the type of the ancestor of a random individual sampled from the equilibrium distribution, given that the initial frequency of the beneficial type was x. The probability h(x) that this ancestor is of type 0 is then given by the probability of at least one success in a random number of L ∞ coin tosses, each with success probability x, as summarised in the following theorem, once more from [5,12]. x(1 − x) n a n , where a n := P(L ∞ > n) = p n with p from Proposition 3 (including the limiting cases).…”
Section: Propositionmentioning
confidence: 99%