1
|
Mintrone C, Rindi L, Bertocci I, Maggi E, Benedetti-Cecchi L. Modularity buffers the spread of spatial perturbations in macroalgal networks. Curr Biol 2025; 35:154-162.e4. [PMID: 39706172 DOI: 10.1016/j.cub.2024.11.038] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/23/2024] [Revised: 11/18/2024] [Accepted: 11/19/2024] [Indexed: 12/23/2024]
Abstract
Theory predicts that spatial modular networks contain the propagation of local disturbances, but field experimental tests of this hypothesis are lacking. We combined a field experiment with a metacommunity model to assess the role of modularity in buffering the spatial spread of algal turfs in three replicated canopy-dominated macroalgal networks. Experimental networks included three modules where plots with intact canopy cover (nodes) were connected through canopy-thinned corridors. The local perturbation consisted of removal of the canopy and understory species from four nodes within a single module to enable the establishment of algal turfs, which could then spread vegetatively to other untouched nodes through the canopy-thinned links. Results show that algal turfs invade mainly untouched nodes in the perturbed module, in agreement with the hypothesis that modularity can effectively constrain the spread of a spatial perturbation. The metacommunity model supports the empirical findings, illustrating greater resistance to perturbations of modular than random macroalgal canopy networks and making alternative explanations for the observed results unlikely. Evidence that the buffering effect of modularity can operate in natural environmental conditions has important implications for designing more robust networks of protected areas and less-fragile human-dominated fragmented landscapes.
Collapse
Affiliation(s)
- Caterina Mintrone
- Department of Biology, University of Pisa, Via Derna 1, 56126 Pisa, Italy; CoNISMa, Piazzale Flaminio 9, 00196 Rome, Italy.
| | - Luca Rindi
- Department of Biology, University of Pisa, Via Derna 1, 56126 Pisa, Italy; CoNISMa, Piazzale Flaminio 9, 00196 Rome, Italy
| | - Iacopo Bertocci
- Department of Biology, University of Pisa, Via Derna 1, 56126 Pisa, Italy; CoNISMa, Piazzale Flaminio 9, 00196 Rome, Italy; Stazione Zoologica Anton Dohrn, Villa Comunale, 80121 Naples, Italy
| | - Elena Maggi
- Department of Biology, University of Pisa, Via Derna 1, 56126 Pisa, Italy; CoNISMa, Piazzale Flaminio 9, 00196 Rome, Italy
| | - Lisandro Benedetti-Cecchi
- Department of Biology, University of Pisa, Via Derna 1, 56126 Pisa, Italy; CoNISMa, Piazzale Flaminio 9, 00196 Rome, Italy
| |
Collapse
|
2
|
Both C, Dehmamy N, Yu R, Barabási AL. Accelerating network layouts using graph neural networks. Nat Commun 2023; 14:1560. [PMID: 36944640 PMCID: PMC10030870 DOI: 10.1038/s41467-023-37189-2] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/19/2022] [Accepted: 03/03/2023] [Indexed: 03/23/2023] Open
Abstract
Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret "hairball" layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm's ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.
Collapse
Affiliation(s)
- Csaba Both
- Network Science Institute, Northeastern University, Boston, MA, USA
| | - Nima Dehmamy
- MIT-IBM Watson AI Lab, IBM Research, Cambridge, MA, USA
| | - Rose Yu
- Department of Computer Science and Engineering, University of California, San Diego, CA, USA
| | - Albert-László Barabási
- Network Science Institute, Northeastern University, Boston, MA, USA.
- Department of Medicine, Brigham and Women's Hospital, Harvard Medical School, Boston, MA, USA.
- Department of Data and Network Science, Central European University, Budapest, Hungary.
| |
Collapse
|
3
|
Gates AJ, Brattig Correia R, Wang X, Rocha LM. The effective graph reveals redundancy, canalization, and control pathways in biochemical regulation and signaling. Proc Natl Acad Sci U S A 2021; 118:e2022598118. [PMID: 33737396 PMCID: PMC8000424 DOI: 10.1073/pnas.2022598118] [Citation(s) in RCA: 35] [Impact Index Per Article: 8.8] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/21/2022] Open
Abstract
The ability to map causal interactions underlying genetic control and cellular signaling has led to increasingly accurate models of the complex biochemical networks that regulate cellular function. These network models provide deep insights into the organization, dynamics, and function of biochemical systems: for example, by revealing genetic control pathways involved in disease. However, the traditional representation of biochemical networks as binary interaction graphs fails to accurately represent an important dynamical feature of these multivariate systems: some pathways propagate control signals much more effectively than do others. Such heterogeneity of interactions reflects canalization-the system is robust to dynamical interventions in redundant pathways but responsive to interventions in effective pathways. Here, we introduce the effective graph, a weighted graph that captures the nonlinear logical redundancy present in biochemical network regulation, signaling, and control. Using 78 experimentally validated models derived from systems biology, we demonstrate that 1) redundant pathways are prevalent in biological models of biochemical regulation, 2) the effective graph provides a probabilistic but precise characterization of multivariate dynamics in a causal graph form, and 3) the effective graph provides an accurate explanation of how dynamical perturbation and control signals, such as those induced by cancer drug therapies, propagate in biochemical pathways. Overall, our results indicate that the effective graph provides an enriched description of the structure and dynamics of networked multivariate causal interactions. We demonstrate that it improves explainability, prediction, and control of complex dynamical systems in general and biochemical regulation in particular.
Collapse
Affiliation(s)
- Alexander J Gates
- Network Science Institute, Northeastern University, Boston, MA 02115;
| | - Rion Brattig Correia
- Instituto Gulbenkian de Ciência, 2780-156 Oeiras, Portugal
- Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, Ministry of Education of Brazil, 70040-020 Brasília, DF, Brazil
| | - Xuan Wang
- Center for Social and Biomedical Complexity, Luddy School of Informatics, Computing & Engineering, Indiana University, Bloomington, IN 47408
| | - Luis M Rocha
- Instituto Gulbenkian de Ciência, 2780-156 Oeiras, Portugal;
- Center for Social and Biomedical Complexity, Luddy School of Informatics, Computing & Engineering, Indiana University, Bloomington, IN 47408
- Department of Systems Science and Industrial Engineering, Binghamton University, Binghamton, NY 13902
| |
Collapse
|
4
|
Carreira DC, Dáttilo W, Bruno DL, Percequillo AR, Ferraz KMPMB, Galetti M. Small vertebrates are key elements in the frugivory networks of a hyperdiverse tropical forest. Sci Rep 2020; 10:10594. [PMID: 32601315 PMCID: PMC7324603 DOI: 10.1038/s41598-020-67326-6] [Citation(s) in RCA: 17] [Impact Index Per Article: 3.4] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/18/2019] [Accepted: 05/19/2020] [Indexed: 11/21/2022] Open
Abstract
The local, global or functional extinction of species or populations of animals, known as defaunation, can erode important ecological services in tropical forests. Many mutualistic interactions, such as seed dispersal of large seeded plants, can be lost in large continuous forests due to the rarity of large-bodied mammalian frugivores. Most of studies that try to elucidate the effects of defaunation on seed dispersal focused on primates or birds, and we lack a detailed understanding on the interactions between ground-dwelling fauna and fleshy fruits. Using camera traps in forest areas with different degrees of defaunation, we described the organization of frugivory networks involving birds, mammals and plants. We recorded 375 frugivory interactions between 21 frugivores and 150 fruiting trees of 30 species of fleshy fruit plants in six sites in continuous Atlantic forest of Brazil. We found that small frugivores-particularly small rodents and birds-were responsible for 72% of the events of frugivory. Large frugivores, such as tapirs and peccaries, were responsible for less than 21% of frugivory events. Our results indicate that the interactions between flesh fruiting plants and frugivores are dominated by small frugivores, an indication of a functional loss of large frugivores in this endangered biome.
Collapse
Affiliation(s)
- Daiane C Carreira
- Programa Interunidades de Pós Graduação em Ecologia Aplicada, Escola Superior de Agricultura "Luiz de Queiroz"- Universidade de São Paulo (ESALQ-USP), Piracicaba, São Paulo, CP 13418-900, Brazil.
- Fundação Hermínio Ometto - FHO|Uniararas, Araras, São Paulo, CP 13607-339, Brazil.
| | - Wesley Dáttilo
- Red de Ecoetología, Instituto de Ecología A.C., CP 91070, Xalapa, Veracruz, Mexico
| | - Dáfini L Bruno
- Programa de Pós Graduação em Ecologia e Recursos Naturais - Universidade Federal de São Carlos (UFSCar), São Carlos, São Paulo, CP 13565-905, Brazil
| | - Alexandre Reis Percequillo
- Departamento de Ciências Biológicas, Escola Superior de Agricultura "Luiz de Queiroz" - Universidade de São Paulo (ESALQ-USP), Piracicaba, São Paulo, CP 13418-900, Brazil
| | - Katia M P M B Ferraz
- Departamento de Ciências Florestais, Escola Superior de Agricultura "Luiz de Queiroz" - Universidade de São Paulo (ESALQ-USP), Piracicaba, São Paulo, CP 13418-900, Brazil
| | - Mauro Galetti
- Department of Biology, University of Miami, Coral Gables, FL, CP 33146, USA
- Departamento de Biodiversidade, Universidade Estadual Paulista (UNESP), Rio Claro, São Paulo, CP 13506-900, Brazil
| |
Collapse
|
5
|
Schaub MT, Delvenne JC, Lambiotte R, Barahona M. Multiscale dynamical embeddings of complex networks. Phys Rev E 2019; 99:062308. [PMID: 31330590 DOI: 10.1103/physreve.99.062308] [Citation(s) in RCA: 23] [Impact Index Per Article: 3.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/02/2018] [Indexed: 11/07/2022]
Abstract
Complex systems and relational data are often abstracted as dynamical processes on networks. To understand, predict, and control their behavior, a crucial step is to extract reduced descriptions of such networks. Inspired by notions from control theory, we propose a time-dependent dynamical similarity measure between nodes, which quantifies the effect a node-input has on the network. This dynamical similarity induces an embedding that can be employed for several analysis tasks. Here we focus on (i) dimensionality reduction, i.e., projecting nodes onto a low-dimensional space that captures dynamic similarity at different timescales, and (ii) how to exploit our embeddings to uncover functional modules. We exemplify our ideas through case studies focusing on directed networks without strong connectivity and signed networks. We further highlight how certain ideas from community detection can be generalized and linked to control theory, by using the here developed dynamical perspective.
Collapse
Affiliation(s)
- Michael T Schaub
- Institute for Data, Systems and Society, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA.,Department of Engineering Science, University of Oxford, Oxford, United Kingdom
| | - Jean-Charles Delvenne
- ICTEAM, Université catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium.,CORE, Université catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium
| | - Renaud Lambiotte
- Mathematical Institute, University of Oxford, Oxford, United Kingdom
| | - Mauricio Barahona
- Department of Mathematics, Imperial College London, London SW7 2AZ, United Kingdom
| |
Collapse
|