SearcharxivSearch

arXiv · 2012.01215

Stochastic persistence in degenerate stochastic Lotka-Volterra food chains

Abstract

We consider a Lotka-Volterra food chain model with possibly intra-specific competition in a stochastic environment represented by stochastic differential equations. In the non-degenerate setting, this model has already been studied by A. Hening and D. Nguyen. They provided conditions for stochastic persistence and extinction. In this paper, we extend their results to the degenerate situation in which the top or the bottom species is subject to random perturbations. Under the persistence condition, there exists a unique invariant probability measure supported by the interior of $\mathbb{R}_+^n$ having a smooth density. Moreover, we study a more general model, in which we give new conditions which make it possible to characterise the convergence of the semi-group towards the unique invariant probability measure either at an exponential rate or at a polynomial one. This will be used in the stochastic Lotka-Volterra food chain to see that if intra-specific competition occurs for all species, the rate of convergence is exponential while in the other cases it is polynomial.

Explore related subjects

Keep this discovery

BibTeXRIS

Michel Benaïm, Antoine Bourquin, Dang H. Nguyen. 2020-12-02. Stochastic persistence in degenerate stochastic Lotka-Volterra food chains. https://arxiv.org/abs/2012.01215

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