SearcharxivSearch

arXiv · 1907.06965

Stochastic Evolution of spatial populations: From configurations to genealogies and back

Abstract

The paper reviews the results obtained for spatial population models and the evolution of the genealogies of these populations during the last decade by the author and his coworkers. The focus is on their large scale behaviour and on the analysis of universality classes of large scale behaviour via the methods of the hierarchical mean-field limit or via the spatial continuum limit and from another angel, the finite system scheme . We use genealogical information to analyze the type and location structure and vice versa. To apply this approach and to explain effects in biological situations we extend the classical model classes in new directions. Namely we look as population models here at: Fleming-Viot genealogies in continuum geographic space, Cannings models with block resampling (reducing diversity), Fisher-Wright diffusion with coloured seedbanks (enhancing diversity) and evolving genealogies of Fleming-Viot models with selection and rare mutation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Greven. 2019-07-16. Stochastic Evolution of spatial populations: From configurations to genealogies and back. https://arxiv.org/abs/1907.06965

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