Stability criteria for complex ecosystems

捕食 生态学 生态网络 捕食者 理论(学习稳定性) 生态系统 食物网 生态系统理论 生物 计算机科学 机器学习
作者
Stefano Allesina,Si Tang
出处
期刊:Nature [Nature Portfolio]
卷期号:483 (7388): 205-208 被引量:1059
标识
DOI:10.1038/nature10832
摘要

Analysis of stability criteria for different types of complex ecological network shows key differences between predator–prey interactions, which are stabilizing, and competitive and mutualistic interactions, which are destabilizing. Writing in Nature 40 years ago, Robert May questioned a central belief in ecology. The accepted wisdom was that complex ecosystems were more stable than simpler ones, but May proved that sufficiently large or complex ecological networks tend towards instability. Since then, much work in theoretical ecology has centred on learning why specific non-random networks are stable in practice. Stefano Allesina and Si Tang have analysed stability criteria for different types of realistic networks, and found key differences between predator–prey interactions, which are stabilizing, and competitive and mutualistic interactions, which are destabilizing. Forty years ago, May proved1,2 that sufficiently large or complex ecological networks have a probability of persisting that is close to zero, contrary to previous expectations3,4,5. May analysed large networks in which species interact at random1,2,6. 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 imposed7,8 or if there is a large preponderance of weak interactions9,10. Similarly, stability is negatively affected by nestedness11,12,13,14 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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
JingP完成签到,获得积分10
刚刚
Owen应助Qvby3采纳,获得30
1秒前
草莓熊和他的豆角完成签到,获得积分10
1秒前
漂亮天真完成签到,获得积分10
1秒前
2秒前
LSS发布了新的文献求助10
2秒前
全一斩完成签到,获得积分10
3秒前
炎炎夏无声完成签到 ,获得积分10
3秒前
宁幼萱完成签到,获得积分10
4秒前
hdh完成签到,获得积分10
4秒前
aaggaga完成签到,获得积分10
4秒前
闪闪岩完成签到,获得积分10
4秒前
4秒前
赘婿应助Isaac采纳,获得10
5秒前
络桵发布了新的文献求助10
5秒前
科研牛马完成签到,获得积分10
5秒前
皮老八完成签到,获得积分10
5秒前
研友_Z3342Z完成签到,获得积分10
5秒前
罪恶完成签到,获得积分10
5秒前
罗YF完成签到,获得积分10
5秒前
醉翁完成签到,获得积分10
5秒前
陈_Ccc完成签到 ,获得积分10
5秒前
Lvy完成签到,获得积分10
6秒前
6秒前
温眼张完成签到,获得积分10
6秒前
chenchen发布了新的文献求助10
7秒前
sll完成签到,获得积分10
7秒前
HJJ完成签到,获得积分10
7秒前
璐璐完成签到 ,获得积分10
7秒前
迷你的夜天完成签到 ,获得积分10
8秒前
8秒前
8秒前
梓树发布了新的文献求助10
8秒前
Hang完成签到,获得积分10
9秒前
9秒前
西溪完成签到,获得积分10
9秒前
一只东北鸟完成签到 ,获得积分10
10秒前
明理的延恶完成签到 ,获得积分10
10秒前
是陶不言啊完成签到,获得积分10
11秒前
苗条的一一完成签到,获得积分10
12秒前
高分求助中
Les Mantodea de Guyane Insecta, Polyneoptera 2500
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 (PDF!) 1000
Technologies supporting mass customization of apparel: A pilot project 450
Tip60 complex regulates eggshell formation and oviposition in the white-backed planthopper, providing effective targets for pest control 400
A Field Guide to the Amphibians and Reptiles of Madagascar - Frank Glaw and Miguel Vences - 3rd Edition 400
China Gadabouts: New Frontiers of Humanitarian Nursing, 1941–51 400
The Healthy Socialist Life in Maoist China, 1949–1980 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3788474
求助须知:如何正确求助?哪些是违规求助? 3333771
关于积分的说明 10263619
捐赠科研通 3049740
什么是DOI,文献DOI怎么找? 1673652
邀请新用户注册赠送积分活动 802148
科研通“疑难数据库(出版商)”最低求助积分说明 760526