SearcharxivSearch

arXiv · 2005.13491

Success probability for selectively neutral invading species in the line model with a random fitness landscape

Abstract

We consider a spatial (line) model for invasion of a population by a single mutant with a stochastically selectively neutral fitness landscape, independent from the fitness landscape for non-mutants. This model is similar to those considered in Farhang-Sardroodi et al. [PLOS Comput. Biol., 13(11), 2017; J. R. Soc. Interface, 16(157), 2019]. We show that the probability of mutant fixation in a population of size $N$, starting from a single mutant, is greater than $1/N$, which would be the case if there were no variation in fitness whatsoever. In the small variation regime, we recover precise asymptotics for the success probability of the mutant. This demonstrates that the introduction of randomness provides an advantage to minority mutations in this model, and shows that the advantage increases with the system size. We further demonstrate that the mutants have an advantage in this setting only because they are better at exploiting unusually favorable environments when they arise, and not because they are any better at exploiting pockets of favorability in an environment that is selectively neutral overall.

Explore related subjects

Keep this discovery

BibTeXRIS

Suzan Farhang-Sardroodi, Natalia L. Komarova, Marcus Michelen, Robin Pemantle. 2020-05-27. Success probability for selectively neutral invading species in the line model with a random fitness landscape. https://doi.org/10.1111/sapm.12373

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