SearcharxivSearch

arXiv · 2111.12750

Random switching in an ecosystem with two prey and one predator

Abstract

In this paper we study the long term dynamics of two prey species and one predator species. In the deterministic setting, if we assume the interactions are of Lotka-Volterra type (competition or predation), the long term behavior of this system is well known. However, nature is usually not deterministic. All ecosystems experience some type of random environmental fluctuations. We incorporate these into a natural framework as follows. Suppose the environment has two possible states. In each of the two environmental states the dynamics is governed by a system of Lotka-Volterra ODE. The randomness comes from spending an exponential amount of time in each environmental state and then switching to the other one. We show how this random switching can create very interesting phenomena. In some cases the randomness can facilitate the coexistence of the three species even though coexistence is impossible in each of the two environmental states. In other cases, even though there is coexistence in each of the two environmental states, switching can lead to the loss of one or more species. We look into how predators and environmental fluctuations can mediate coexistence among competing species.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexandru Hening, Dang Nguyen, Nhu Nguyen, Harrison Watts. 2021-11-24. Random switching in an ecosystem with two prey and one predator. https://arxiv.org/abs/2111.12750

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