scholarly journals The feasibility and stability of large complex biological networks: a random matrix approach

2017 ◽  
Author(s):  
Lewi Stone

AbstractIn his theoretical work of the 70’s, Robert May introduced a Random Matrix Theory (RMT) approach for studying the stability of large complex biological systems. Unlike the established paradigm, May demonstrated that complexity leads to instability in generic models of biological networks. The RMT approach has since similarly been applied in many disciplines. Central to the approach is the famous “circular law” that describes the eigenvalue distribution of an important class of random matrices. However the “circular law” generally does not apply for ecological and biological systems in which density-dependence (DD) operates. Here we directly determine the far more complicated eigenvalue distributions of complex DD systems. A simple mathematical solution falls out, that allows us to explore the connection between feasible systems (i.e., having all equilibrium populations positive) and stability. In particular, for these RMT systems, almost all feasible systems are stable. The degree of stability, or resilience, is shown to depend on the minimum equilibrium population, and not directly on factors such as network topology.

2006 ◽  
Vol 357 (6) ◽  
pp. 420-423 ◽  
Author(s):  
Feng Luo ◽  
Jianxin Zhong ◽  
Yunfeng Yang ◽  
Richard H. Scheuermann ◽  
Jizhong Zhou

Author(s):  
F LUO ◽  
J ZHONG ◽  
Y YANG ◽  
R SCHEUERMANN ◽  
J ZHOU

2019 ◽  
Author(s):  
Jimmy J. Qian ◽  
Erol Akçay

What determines the assembly and stability of complex communities is a central question in ecology. Past work has suggested that mutualistic interactions are inherently destabilizing. However, this conclusion relies on assuming that benefits from mutualisms never stop increasing. Furthermore, almost all theoretical work focuses on the internal (asymptotic) stability of communities assembled all-at-once. Here, we present a model with saturating benefits from mutualisms and sequentially assembled communities. We show that such communities are internally stable for any level of diversity and any combination of species interaction types. External stability, or resistance to invasion, is thus an important but overlooked measure of stability. We demonstrate that the balance of different interaction types governs community dynamics. Mutualisms may increase external stability and diversity of communities as well as species persistence, depending on how benefits saturate. Ecological selection increases the prevalence of mutualisms, and limits on biodiversity emerge from species interactions. Our results help resolve longstanding debates on the stability, saturation, and diversity of communities.


Author(s):  
A.A. Dronic A.A. ◽  

The article presents an assessment of the stability of introduced cherry varieties to spring return frosts in 2020 in the conditions of the sharply continental climate of the Astrakhan region. As a result of unfavorable weather conditions, the total damage score of all varieties was 2-5 points. Almost all the studied varieties showed an insufficient level of resistance to recurrent frosts.


Author(s):  
Jan W Dash ◽  
Xipei Yang ◽  
Mario Bondioli ◽  
Harvey J. Stein

Author(s):  
Oriol Bohigas ◽  
Hans A. Weidenmüller

An overview of the history of random matrix theory (RMT) is provided in this chapter. Starting from its inception, the authors sketch the history of RMT until about 1990, focusing their attention on the first four decades of RMT. Later developments are partially covered. In the past 20 years RMT has experienced rapid development and has expanded into a number of areas of physics and mathematics.


Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 976
Author(s):  
R. Aguilar-Sánchez ◽  
J. Méndez-Bermúdez ◽  
José Rodríguez ◽  
José Sigarreta

We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.


Sign in / Sign up

Export Citation Format

Share Document