SearcharxivSearch

arXiv · 2503.21403

Bounds for survival probabilities in supercritical Galton-Watson processes and applications to population genetics

Also available from

Abstract

Population genetic processes, such as the adaptation of a quantitative trait to directional selection, may occur on longer time scales than the sweep of a single advantageous mutation. To study such processes in finite populations, approximations for the time course of the distribution of a beneficial mutation were derived previously by branching process methods. The application to the evolution of a quantitative trait requires bounds for the probability of survival $S^{(n)}$ up to generation $n$ of a single beneficial mutation. Here, we present a method to obtain a simple, analytically explicit, either upper or lower, bound for $S^{(n)}$ in a supercritical Galton-Watson process. We prove the existence of an upper bound for offspring distributions including Poisson, binomial, and negative binomial. They are constructed by bounding the given generating function, $\varphi$, by a fractional linear one that has the same survival probability $S^\infty$ and yields the same rate of convergence of $S^{(n)}$ to $S^\infty$ as $\varphi$. For distributions with at most three offspring, we characterize when this method yields an upper bound, a lower bound, or only an approximation. Because for many distributions it is difficult to get a handle on $S^\infty$, we derive an approximation by series expansion in $s$, where $s$ is the selective advantage of the mutant. We briefly review well-known asymptotic results that generalize Haldane's approximation $2s$ for $S^\infty$, as well as less well-known results on sharp bounds for $S^\infty$. We apply them to explore when bounds for $S^{(n)}$ exist for a family of generalized Poisson distributions. Numerical results demonstrate the accuracy of our and of previously derived bounds for $S^\infty$ and $S^{(n)}$. Finally, as an application we determine the response of a quantitative trait caused by new beneficial mutations to prolonged directional selection.

Explore related subjects

Keep this discovery

BibTeXRIS

Reinhard Bürger. 2025-03-27. Bounds for survival probabilities in supercritical Galton-Watson processes and applications to population genetics. https://doi.org/10.1007/s00285-026-02349-7

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