Cargando…
Attack Robustness and Centrality of Complex Networks
Many complex systems can be described by networks, in which the constituent components are represented by vertices and the connections between the components are represented by edges between the corresponding vertices. A fundamental issue concerning complex networked systems is the robustness of the...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3615130/ https://www.ncbi.nlm.nih.gov/pubmed/23565156 http://dx.doi.org/10.1371/journal.pone.0059613 |
_version_ | 1782264975290531840 |
---|---|
author | Iyer, Swami Killingback, Timothy Sundaram, Bala Wang, Zhen |
author_facet | Iyer, Swami Killingback, Timothy Sundaram, Bala Wang, Zhen |
author_sort | Iyer, Swami |
collection | PubMed |
description | Many complex systems can be described by networks, in which the constituent components are represented by vertices and the connections between the components are represented by edges between the corresponding vertices. A fundamental issue concerning complex networked systems is the robustness of the overall system to the failure of its constituent parts. Since the degree to which a networked system continues to function, as its component parts are degraded, typically depends on the integrity of the underlying network, the question of system robustness can be addressed by analyzing how the network structure changes as vertices are removed. Previous work has considered how the structure of complex networks change as vertices are removed uniformly at random, in decreasing order of their degree, or in decreasing order of their betweenness centrality. Here we extend these studies by investigating the effect on network structure of targeting vertices for removal based on a wider range of non-local measures of potential importance than simply degree or betweenness. We consider the effect of such targeted vertex removal on model networks with different degree distributions, clustering coefficients and assortativity coefficients, and for a variety of empirical networks. |
format | Online Article Text |
id | pubmed-3615130 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2013 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-36151302013-04-05 Attack Robustness and Centrality of Complex Networks Iyer, Swami Killingback, Timothy Sundaram, Bala Wang, Zhen PLoS One Research Article Many complex systems can be described by networks, in which the constituent components are represented by vertices and the connections between the components are represented by edges between the corresponding vertices. A fundamental issue concerning complex networked systems is the robustness of the overall system to the failure of its constituent parts. Since the degree to which a networked system continues to function, as its component parts are degraded, typically depends on the integrity of the underlying network, the question of system robustness can be addressed by analyzing how the network structure changes as vertices are removed. Previous work has considered how the structure of complex networks change as vertices are removed uniformly at random, in decreasing order of their degree, or in decreasing order of their betweenness centrality. Here we extend these studies by investigating the effect on network structure of targeting vertices for removal based on a wider range of non-local measures of potential importance than simply degree or betweenness. We consider the effect of such targeted vertex removal on model networks with different degree distributions, clustering coefficients and assortativity coefficients, and for a variety of empirical networks. Public Library of Science 2013-04-02 /pmc/articles/PMC3615130/ /pubmed/23565156 http://dx.doi.org/10.1371/journal.pone.0059613 Text en © 2013 Killingback et al http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited. |
spellingShingle | Research Article Iyer, Swami Killingback, Timothy Sundaram, Bala Wang, Zhen Attack Robustness and Centrality of Complex Networks |
title | Attack Robustness and Centrality of Complex Networks |
title_full | Attack Robustness and Centrality of Complex Networks |
title_fullStr | Attack Robustness and Centrality of Complex Networks |
title_full_unstemmed | Attack Robustness and Centrality of Complex Networks |
title_short | Attack Robustness and Centrality of Complex Networks |
title_sort | attack robustness and centrality of complex networks |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3615130/ https://www.ncbi.nlm.nih.gov/pubmed/23565156 http://dx.doi.org/10.1371/journal.pone.0059613 |
work_keys_str_mv | AT iyerswami attackrobustnessandcentralityofcomplexnetworks AT killingbacktimothy attackrobustnessandcentralityofcomplexnetworks AT sundarambala attackrobustnessandcentralityofcomplexnetworks AT wangzhen attackrobustnessandcentralityofcomplexnetworks |