SearcharxivSearch

arXiv · 1106.4050

The spatial Λ-Fleming-Viot process on a large torus: Genealogies in the presence of recombination

Abstract

We extend the spatial $Λ$-Fleming-Viot process introduced in [Electron. J. Probab. 15 (2010) 162-216] to incorporate recombination. The process models allele frequencies in a population which is distributed over the two-dimensional torus $\mathbb{T}(L)$ of sidelength L and is subject to two kinds of reproduction events: small events of radius $\mathcal{O}(1)$ and much rarer large events of radius $\mathcal{O}(L^α)$ for some $α\in(0,1]$. We investigate the correlation between the times to the most recent common ancestor of alleles at two linked loci for a sample of size two from the population. These individuals are initially sampled from "far apart" on the torus. As L tends to infinity, depending on the frequency of the large events, the recombination rate and the initial distance between the two individuals sampled, we obtain either a complete decorrelation of the coalescence times at the two loci, or a sharp transition between a first period of complete correlation and a subsequent period during which the remaining times needed to reach the most recent common ancestor at each locus are independent. We use our computations to derive approximate probabilities of identity by descent as a function of the separation at which the two individuals are sampled.

Explore related subjects

Keep this discovery

BibTeXRIS

A. M. Etheridge, A. Véber. 2012-11-27. The spatial Λ-Fleming-Viot process on a large torus: Genealogies in the presence of recombination. https://doi.org/10.1214/12-aap842

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