Complexity and stability revisited
Abstract
Since Robert May's work on random community matrices it has been known that stability tends to decrease with complexity. Recently, it was shown that this is not necessarily true in competitive ecosystems. We investigated the stability of random ecosystems and found that it can largely be predicted by simple matrix statistics such as the mean and the variance of the interaction coefficients. We use this to explain why stability can increase as well as decrease with complexity in ecological communities. We argue that the variance, and to a lesser extent the mean, of the interaction coefficients go a long way in explaining patterns in the stability of ecosystems.
Keywords
Access
Citation
ID:
268155
References
Blockchain Verification
Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
268155
Unique Identifier:
10.1046/j.1461-0248.2003.00464.x
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
Creates 1,000,000 NFT tokens for this article
Token Features:
- ERC-1155 Standard NFT
- 1 Million Supply per Article
- Transferable via MetaMask
- Permanent Blockchain Record
Scan with Saymatik Web3.0 Wallet
