Unknown

Dataset Information

0

Limits and trade-offs of topological network robustness.


ABSTRACT: 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.

SUBMITTER: Priester C 

PROVIDER: S-EPMC4176960 | biostudies-literature |

REPOSITORIES: biostudies-literature

Similar Datasets

| S-EPMC2913402 | biostudies-literature
| S-EPMC1681473 | biostudies-other
| S-EPMC4268653 | biostudies-other
| S-EPMC3443171 | biostudies-literature
| S-EPMC6738579 | biostudies-literature
| S-EPMC4731922 | biostudies-literature
| S-EPMC5666104 | biostudies-literature
| S-EPMC9340536 | biostudies-literature
| S-EPMC3772006 | biostudies-literature
| S-EPMC5065130 | biostudies-literature