SearcharxivSearch

arXiv · 0808.0412

A modified lookdown construction for the Xi-Fleming-Viot process with mutation and populations with recurrent bottlenecks

Abstract

Let $Λ$ be a finite measure on the unit interval. A $Λ$-Fleming-Viot process is a probability measure valued Markov process which is dual to a coalescent with multiple collisions ($Λ$-coalescent) in analogy to the duality known for the classical Fleming Viot process and Kingman's coalescent, where $Λ$ is the Dirac measure in 0. We explicitly construct a dual process of the coalescent with simultaneous multiple collisions ($Ξ$-coalescent) with mutation, the $Ξ$-Fleming-Viot process with mutation, and provide a representation based on the empirical measure of an exchangeable particle system along the lines of Donnelly and Kurtz (1999). We establish pathwise convergence of the approximating systems to the limiting $Ξ$-Fleming-Viot process with mutation. An alternative construction of the semigroup based on the Hille-Yosida theorem is provided and various types of duality of the processes are discussed. In the last part of the paper a population is considered which undergoes recurrent bottlenecks. In this scenario, non-trivial $Ξ$-Fleming-Viot processes naturally arise as limiting models.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthias Birkner, Jochen Blath, Martin Moehle, Matthias Steinruecken, Johanna Tams. 2008-10-27. A modified lookdown construction for the Xi-Fleming-Viot process with mutation and populations with recurrent bottlenecks. https://arxiv.org/abs/0808.0412

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR