Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0907.3702

Evolution in predator-prey systems

Rick Durrett·John Mayberry
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the adaptive dynamics of predator-prey systems modeled by a dynamical system in which the traits of predators and prey are allowed to evolve by small mutations. When only the prey are allowed to evolve, and the size of the mutational change tends to 0, the system does not exhibit long term prey coexistence and the trait of the resident prey type converges to the solution of an ODE. When only the predators are allowed to evolve, coexistence of predators occurs. In this case, depending on the parameters being varied, we see (i) the number of coexisting predators remains tight and the differences in traits from a reference species converge in distribution to a limit, or (ii) the number of coexisting predators tends to infinity, and we calculate the asymptotic rate at which the traits of the least and most "fit" predators in the population increase. This last result is obtained by comparison with a branching random walk killed to the left of a linear boundary and a finite branching-selection particle system.

Explore related subjects

math.PR

Keep this discovery

BibTeXRIS

Rick Durrett, John Mayberry. 2010-03-22. Evolution in predator-prey systems. https://doi.org/10.1016/j.spa.2010.03.011

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗