SearcharxivSearch

arXiv · 1212.5909

The spatial Lambda-Fleming-Viot process: an event-based construction and a lookdown representation

Abstract

We construct a measure-valued equivalent to the spatial Lambda-Fleming-Viot process (SLFV) introduced in [Eth08]. In contrast with the construction carried out in [Eth08], we fix the realization of the sequence of reproduction events and obtain a quenched evolution of the local genetic diversities. To this end, we use a particle representation which highlights the role of the genealogies in the attribution of types (or alleles) to the individuals of the population. This construction also enables us to clarify the state-space of the SLFV and to derive several path properties of the measure-valued process as well as of the labeled trees describing the genealogical relations between a sample of individuals. We complement it with a look-down construction which provides a particle system whose empirical distribution at time t, seen as a process in t, has the law of the quenched SLFV. In all these results, the facts that we work with a fixed configuration of events and that reproduction occurs only locally in space introduce serious technical issues that are overcome by controlling the number of events occurring and of particles present in a given area over macroscopic time intervals.

Explore related subjects

Keep this discovery

BibTeXRIS

Amandine Veber, Anton Wakolbinger. 2013-09-03. The spatial Lambda-Fleming-Viot process: an event-based construction and a lookdown representation. https://arxiv.org/abs/1212.5909

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