SearcharxivSearch

arXiv · 2111.11247

Feasibility of sparse large Lotka-Volterra ecosystems

Abstract

Consider a large ecosystem (foodweb) with n species, where the abundances follow a Lotka-Volterra system of coupled differential equations. We assume that each species interacts with d other species and that their interaction coefficients are independent random variables. This parameter d reflects the connectance of the foodweb and the sparsity of its interactions especially if d is much smaller that n. We address the question of feasibility of the foodweb, that is the existence of an equilibrium solution of the Lotka-Volterra system with no vanishing species. We establish that for a given range of d with an extra condition on the sparsity structure, there exists an explicit threshold depending on n and d and reflecting the strength of the interactions, which guarantees the existence of a positive equilibrium as the number of species n gets large. From a mathematical point of view, the study of feasibility is equivalent to the existence of a positive solution (component-wise) to the equilibrium linear equation. The analysis of such positive solutions essentially relies on large random matrix theory for sparse matrices and Gaussian concentration of measure. The stability of the equilibrium is established. The results in this article extend to a sparse setting the results obtained by Bizeul and Najim in Proc. AMS 2021.

Explore related subjects

Keep this discovery

BibTeXRIS

Imane Akjouj, Jamal Najim. 2021-11-22. Feasibility of sparse large Lotka-Volterra ecosystems. https://arxiv.org/abs/2111.11247

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