SearcharxivSearch

arXiv · 1705.10250

SuperBrownian motion and the spatial Lambda-Fleming-Viot process

Abstract

It is well known that the dynamics of a subpopulation of individuals of a rare type in a Wright-Fisher diffusion can be approximated by a Feller branching process. Here we establish an analogue of that result for a spatially distributed population whose dynamics are described by a spatial Lambda-Fleming-Viot process (SLFV). The subpopulation of rare individuals is then approximated by a superBrownian motion. This result mirrors Cox et al. (2000), where it is shown that when suitably rescaled, sparse voter models converge to superBrownian motion. We also prove the somewhat more surprising result, that by choosing the dynamics of the SLFV appropriately we can recover superBrownian motion with stable branching in an analogous way. This is a spatial analogue of (a special case of) results of Bertoin and Le Gall (2006), who show that the generalised Fleming-Viot process that is dual to the beta-coalescent, when suitably rescaled, converges to a continuous state branching process with stable branching mechanism.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan A. Chetwynd-Diggle, Alison M. Etheridge. 2017-05-29. SuperBrownian motion and the spatial Lambda-Fleming-Viot process. https://arxiv.org/abs/1705.10250

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