SearcharxivSearch

arXiv · 2406.20097

Predator-prey density-dependent branching processes

Abstract

Two density-dependent branching processes are considered to model predator-prey populations. For both models, preys are considered to be the main food supply of predators. Moreover, in each generation the number of individuals of each species is distributed according to a binomial distribution with size given by the species population size and probability of success depending on the density of preys per predator at the current generation. The difference between the two proposed processes lies in the food supply of preys. In the first one, we consider that preys have all the food they need at their disposal while in the second one, we assume that the natural resources of the environment are limited and therefore there exists a competition among preys for food supplies. Results on the fixation and extinction of both species as well as conditions for the coexistence are provided for the first model. On the event of coexistence of both populations and on the prey fixation event, the limiting growth rates are obtained. For the second model, we prove that the extinction of the entire system occurs almost surely. Finally, the evolution of both models over the generations is illustrated by simulated examples. Those examples validate our analytical findings.

Explore related subjects

Keep this discovery

BibTeXRIS

Cristina Gutiérrez, Carmen Minuesa. 2024-06-28. Predator-prey density-dependent branching processes. https://doi.org/10.1080/15326349.2022.2032755

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