Limits and trade-offs of topological network robustness.
We investigate the trade-off between the robustness against random and targeted removal of nodes from a network. To this end we utilize the stochastic block model to study ensembles of infinitely large networks with arbitrary large-scale structures. We present results from numerical two-objective op...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2014-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC4176960?pdf=render |
| _version_ | 1818136469544370176 |
|---|---|
| author | Christopher Priester Sebastian Schmitt Tiago P Peixoto |
| author_facet | Christopher Priester Sebastian Schmitt Tiago P Peixoto |
| author_sort | Christopher Priester |
| collection | DOAJ |
| description | We investigate the trade-off between the robustness against random and targeted removal of nodes from a network. To this end we utilize the stochastic block model to study ensembles of infinitely large networks with arbitrary large-scale structures. We present results from numerical two-objective optimization simulations for networks with various fixed mean degree and number of blocks. The results provide strong evidence that three different blocks are sufficient to realize the best trade-off between the two measures of robustness, i.e. to obtain the complete front of Pareto-optimal networks. For all values of the mean degree, a characteristic three block structure emerges over large parts of the Pareto-optimal front. This structure can be often characterized as a core-periphery structure, composed of a group of core nodes with high degree connected among themselves and to a periphery of low-degree nodes, in addition to a third group of nodes which is disconnected from the periphery, and weakly connected to the core. Only at both extremes of the Pareto-optimal front, corresponding to maximal robustness against random and targeted node removal, a two-block core-periphery structure or a one-block fully random network are found, respectively. |
| first_indexed | 2024-12-11T09:40:54Z |
| format | Article |
| id | doaj.art-71d9f3ad62d048919d19658cd0ae961a |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-12-11T09:40:54Z |
| publishDate | 2014-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-71d9f3ad62d048919d19658cd0ae961a2022-12-22T01:12:40ZengPublic Library of Science (PLoS)PLoS ONE1932-62032014-01-0199e10821510.1371/journal.pone.0108215Limits and trade-offs of topological network robustness.Christopher PriesterSebastian SchmittTiago P PeixotoWe investigate the trade-off between the robustness against random and targeted removal of nodes from a network. To this end we utilize the stochastic block model to study ensembles of infinitely large networks with arbitrary large-scale structures. We present results from numerical two-objective optimization simulations for networks with various fixed mean degree and number of blocks. The results provide strong evidence that three different blocks are sufficient to realize the best trade-off between the two measures of robustness, i.e. to obtain the complete front of Pareto-optimal networks. For all values of the mean degree, a characteristic three block structure emerges over large parts of the Pareto-optimal front. This structure can be often characterized as a core-periphery structure, composed of a group of core nodes with high degree connected among themselves and to a periphery of low-degree nodes, in addition to a third group of nodes which is disconnected from the periphery, and weakly connected to the core. Only at both extremes of the Pareto-optimal front, corresponding to maximal robustness against random and targeted node removal, a two-block core-periphery structure or a one-block fully random network are found, respectively.http://europepmc.org/articles/PMC4176960?pdf=render |
| spellingShingle | Christopher Priester Sebastian Schmitt Tiago P Peixoto Limits and trade-offs of topological network robustness. PLoS ONE |
| title | Limits and trade-offs of topological network robustness. |
| title_full | Limits and trade-offs of topological network robustness. |
| title_fullStr | Limits and trade-offs of topological network robustness. |
| title_full_unstemmed | Limits and trade-offs of topological network robustness. |
| title_short | Limits and trade-offs of topological network robustness. |
| title_sort | limits and trade offs of topological network robustness |
| url | http://europepmc.org/articles/PMC4176960?pdf=render |
| work_keys_str_mv | AT christopherpriester limitsandtradeoffsoftopologicalnetworkrobustness AT sebastianschmitt limitsandtradeoffsoftopologicalnetworkrobustness AT tiagoppeixoto limitsandtradeoffsoftopologicalnetworkrobustness |