Papers › Stable coexistence in indefinitely large systems of competing species

Stable coexistence in indefinitely large systems of competing species

22 Apr 2024arXiv:2404.14031links table onlyarchive 2025-07-28

M. N. Mooij, M. Baudena, A. S. von der Heydt, I. Kryven

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The Lotka-Volterra system is a set of ordinary differential equations describing growth of interacting ecological species. This model has gained renewed interest in the context of random interaction networks. One of the debated questions is understanding how the number of species in the system, n, influences the stability of the model. Robert May demonstrated that large systems become unstable, unless species-species interactions vanish. This outcome has frequently been interpreted as a universal phenomenon and summarised as "large systems are unstable". However, May's results were performed on a specific type of graphs (Erd\H{o}s-R\'enyi), whereas we explore a different class of networks and we show that the competitive Lotka-Volterra system maintains stability even in the limit of large n, despite non-vanishing interaction strength. We establish a lower bound on the interspecific interaction strength, formulated in terms of the maximum and minimum degrees of the ecological network, rather than being dependent upon the network's size. For values below this threshold, coexistence of all species is attained in the asymptotic limit. In other words, the outlier nodes with large degree cause instability, rather than the large number of species in the system. Our result refines May's bound, by showing that the type of network model is relevant and can lead to completely different results.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections