2014
DOI: 10.1017/s0001867800007527
|View full text |Cite
|
Sign up to set email alerts
|

The Λ-Fleming-Viot Process and a Connection with Wright-Fisher Diffusion

Abstract: The d-dimensional Λ-Fleming-Viot generator acting on functions g(x x x), with x x x being a vector of d allele frequencies, can be written as a Wright-Fisher generator acting on functions g with a modified random linear argument of x x x induced by partitioning occurring in the Λ-Fleming-Viot process. The eigenvalues and right polynomial eigenvectors are easy to see from the representation. The two-dimensional process, which has a one-dimensional generator, is considered in detail. A nonlinear equation is foun… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
32
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(34 citation statements)
references
References 34 publications
(34 reference statements)
2
32
0
Order By: Relevance
“…where W := U Y for a random variable U uniformly distributed on [0, 1] independent of Y ∼ Λ([0, 1]) −1 Λ. The last equality is inspired by a represantation in Theorem 2 of [Gri14]. Therefore P ∞,m 0 (mig(n − 1)) = γ(n) Borel-Cantelli gives that almost surely only finitely many of the events mig(n), for n ∈ N happen, and thus both sums in (22) Otherwise, the process stays infinite, at least provided Λ({1}) = 0, since in that case by (a) infinitely many blocks migrating to the seed bank in an arbitrarily short time implies that the process stays infinite.…”
Section: Coming Down From Infinitymentioning
confidence: 99%
See 1 more Smart Citation
“…where W := U Y for a random variable U uniformly distributed on [0, 1] independent of Y ∼ Λ([0, 1]) −1 Λ. The last equality is inspired by a represantation in Theorem 2 of [Gri14]. Therefore P ∞,m 0 (mig(n − 1)) = γ(n) Borel-Cantelli gives that almost surely only finitely many of the events mig(n), for n ∈ N happen, and thus both sums in (22) Otherwise, the process stays infinite, at least provided Λ({1}) = 0, since in that case by (a) infinitely many blocks migrating to the seed bank in an arbitrarily short time implies that the process stays infinite.…”
Section: Coming Down From Infinitymentioning
confidence: 99%
“…This feature extends the individual switching of the seed bank coalescent and leads to new qualitative behaviour. The switching of multiple lines at the same time is reminiscent of multiple merger events in Lambda-coalescents ( [Sag99], [Pit99], [DK99]), yet leads to different tree structures, which is reflected in a new type of criterion for "coming down from infinity", interestingly involving arguments from rather elegant recent work by Griffiths [Gri14].…”
Section: Introductionmentioning
confidence: 99%
“…The process X := (X t ) t∈R describing the type-0 frequency in the population then has the generator (cf. [7,10])…”
Section: Model and Main Resultsmentioning
confidence: 99%
“…Combining results of [9] and [10], one infers that Assumption 2.1 is equivalent to the positive recurrence of the process K on N. Indeed, it is proved in [10, Theorem 3] (for the case σ * < ∞) and [9, Theorem 1.1] (for the case σ * = ∞) that Assumption 2.1 is equivalent to P[X ∞ = 1 | X 0 = x] < 1 for all x < 1, where X ∞ denotes the a.s. limit of X t as t → ∞.…”
Section: Model and Main Resultsmentioning
confidence: 99%
See 1 more Smart Citation