Stability Criteria in Nature
A new article in Nature revisits May's classic result.
Back in 2001, when I was studying for my PhD entrance exam, I read May's 1972 paper for the first time, and fell in love with this problem.
May's result is very simple to explain: take S species and suppose that each species interacts with any other with probability C. Then, the expected number of connection for each species is SC. Now assume that the ecosystem is at a steady state: species do not change in density through time if not perturbed. If two species interact, the effect of species a on species b is taken from a normal distribution with mean 0 and variance σ2. Finally, the effect of a species on itself is assumed to be -1 (i.e., there is some sort of self-regulation).
May showed that such networks are almost surely stable (i.e., persist in time despite small perturbations) whenever σ√SC<1, while whenever this threshold is crossed the system is almost surely unstable, and thus should not persist through time. This result sparked a fierce "complexity-stability" debated that lasts to this day. In fact, May's results are difficult to reconcile with the staggering diversity observed in nature: many species (large S) interact in complex networks (large C) of ecological interactions, despite mathematical considerations would tell us this is not possible.
Today, Si and I tackle this problem in a new article just published by Nature:
Forty years ago, May proved that sufficiently large or complex ecological networks have a probability of persisting that is close to zero, contrary to previous expectations. May analysed large networks in which species interact at random. However, in natural systems pairs of species have well-defined interactions (for example predator–prey, mutualistic or competitive). Here we extend May’s results to these relationships and find remarkable differences between predator–prey interactions, which are stabilizing, and mutualistic and competitive interactions, which are destabilizing. We provide analytic stability criteria for all cases. We use the criteria to prove that, counterintuitively, the probability of stability for predator–prey networks decreases when a realistic food web structure is imposed or if there is a large preponderance of weak interactions. Similarly, stability is negatively affected by nestedness in bipartite mutualistic networks. These results are found by separating the contribution of network structure and interaction strengths to stability. Stable predator–prey networks can be arbitrarily large and complex, provided that predator–prey pairs are tightly coupled. The stability criteria are widely applicable, because they hold for any system of differential equations.
Popular science accounts of the research are organized below.