SearcharxivSearch

arXiv · 1903.06731

General selection models: Bernstein duality and minimal ancestral structures

Abstract

$\Lambda$-Wright--Fisher processes provide a robust framework to describe the type-frequency evolution of an infinite neutral population. We add a polynomial drift to the corresponding stochastic differential equation to incorporate frequency-dependent selection. A decomposition of the drift allows us to approximate the solution of the stochastic differential equation by a sequence of Moran models. The genealogical structure underlying the Moran model leads in the large population limit to a generalisation of the ancestral selection graph of Krone and Neuhauser. Building on this object, we construct a continuous-time Markov chain and relate it to the forward process via a new form of duality, which we call Bernstein duality. We adapt classical methods based on the moment duality to determine the time to absorption and criteria for the accessibility of the boundaries; this extends a recent result by Gonz\'alez Casanova and Span\`o. An intriguing feature of the construction is that the same forward process is compatible with multiple backward models. In this context we introduce suitable notions for minimality among the ancestral processes and characterise the corresponding parameter sets. In this way we recover classic ancestral structures as minimal ones.

Explore related subjects

Keep this discovery

BibTeXRIS

Fernando Cordero, Sebastian Hummel, Emmanuel Schertzer. 2019-03-15. General selection models: Bernstein duality and minimal ancestral structures. https://doi.org/10.1214/21-aap1683

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