Papers › Complexity-stability relationships in competitive disordered dynamical systems
Complexity-stability relationships in competitive disordered dynamical systems
Onofrio Mazzarisi, Matteo Smerlak
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.
Robert May famously used random matrix theory to predict that large, complex systems cannot admit stable fixed points. However, this general conclusion is not always supported by empirical observation: from cells to biomes, biological systems are large, complex, and often stable. In this paper, we revisit May's argument in light of recent developments in both ecology and random matrix theory. We focus on competitive systems, and, using a nonlinear generalization of the competitive Lotka-Volterra model, we show that there are, in fact, two kinds of complexity-stability relationships in disordered dynamical systems: if self-interactions grow faster with density than cross-interactions, complexity is destabilizing; but if cross-interactions grow faster than self-interactions, complexity is stabilizing.
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