Search arXivSearch

arXiv · 2602.18942

Feasibility as a moving target: Fluctuating species interactions lead to universal power law in equilibrium abundances

Abstract

Theoretical ecology has traditionally equated persistence with the stability of a fixed equilibrium point. Here we argue that the primary threat to ecosystem persistence need not be the loss of stability, but instead the escape of the stable equilibrium to a negative orthant. In a realistic setting, fluctuations in interactions do not merely disturb abundances about an equilibrium but can displace the equilibrium point itself. We theoretically and empirically analyze such displacements of the equilibrium point in a complex community. Theoretically, we find that light-tailed fluctuations in species interactions, no matter how small, lead to a heavy-tailed power law $P(y)=1/y^α$ for the equilibrium abundance $y$ of a species. Remarkably, the exponent $α=2$ is a universal value independent of interaction structure, community size, and species. Empirically, our analysis of 34 species reveals a power law signal for most, with a median exponent $α\sim2.56$. Next, we derive a formula for the critical noise, $σ_c$, beyond which the community experiences feasibility loss ``with near certainty''. We find that $σ_c(N)\sim N^{-1}$, implying that larger communities are significantly more fragile to noise induced feasibility loss. Lastly, we define and calculate biologically measurable analytical metrics for both global and species-specific feasibility escape rates, and implement these metrics in dynamic simulations of 98 real world mutualistic and food web networks, to successfully predict their fragility.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cagatay Eskin, Vu Nguyen, Dervis Can Vural. 2026-02-21. Feasibility as a moving target: Fluctuating species interactions lead to universal power law in equilibrium abundances. https://arxiv.org/abs/2602.18942

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE