Exploring the topological sources of robustness against invasion in biological and technological networks
Title: | Exploring the topological sources of robustness against invasion in biological and technological networks
|
Author: | Alcalde Cuesta, Fernando
González Sequeiros, Pablo
Lozano Rojo, Álvaro
|
Affiliation: | Universidade de Santiago de Compostela. Departamento de Didácticas Aplicadas Universidade de Santiago de Compostela. Departamento de Matemáticas
|
Subject: | Complex networks | Network topology | Population dynamics | Robustness | |
Date of Issue: | 2016-02-10
|
Publisher: | Nature Publishing Group
|
Citation: | Alcalde Cuesta, F. et al. Exploring the topological sources of robustness against invasion in biological and technological networks. Sci. Rep. 6, 20666; doi: 10.1038/srep20666 (2016)
|
Abstract: | For a network, the accomplishment of its functions despite perturbations is called robustness. Although this property has been extensively studied, in most cases, the network is modified by removing nodes. In our approach, it is no longer perturbed by site percolation, but evolves after site invasion. The process transforming resident/healthy nodes into invader/mutant/diseased nodes is described by the Moran model. We explore the sources of robustness (or its counterpart, the propensity to spread favourable innovations) of the US high-voltage power grid network, the Internet2 academic network, and the C. elegans connectome. We compare them to three modular and non-modular benchmark networks, and samples of one thousand random networks with the same degree distribution. It is found that, contrary to what happens with networks of small order, fixation probability and robustness are poorly correlated with most of standard statistics, but they depend strongly on the degree distribution. While community detection techniques are able to detect the existence of a central core in Internet2, they are not effective in detecting hierarchical structures whose topological complexity arises from the repetition of a few rules. Box counting dimension and Rent’s rule are applied to show a subtle trade-off between topological and wiring complexity |
Publisher version: | https://doi.org/10.1038/srep20666 |
URI: | http://hdl.handle.net/10347/16188
|
ISSN: | 2045-2322
|
Rights: | © The Author(s) 2016. This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/
|