Search arXivSearch

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, $φ$, 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 $φ$. 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

Explore connections, maps & timelines

BibTeXRIS

Reinhard Bürger. 2026-01-21. 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

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR