Limits and trade-offs of topological network robustness.
Ontology highlight
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,
SUBMITTER: Priester C
PROVIDER: S-EPMC4176960 | biostudies-literature | 2014
REPOSITORIES: biostudies-literature
ACCESS DATA