Ontology highlight
ABSTRACT:
SUBMITTER: Braunstein A
PROVIDER: S-EPMC5098660 | biostudies-literature | 2016 Nov
REPOSITORIES: biostudies-literature
Braunstein Alfredo A Dall'Asta Luca L Semerjian Guilhem G Zdeborová Lenka L
Proceedings of the National Academy of Sciences of the United States of America 20161018 44
We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For a large class of random graphs, this problem is tightly connected to the decycling problem (the removal of vertices, leaving the graph acyclic). Exploiting this connection and recent works on epidemic spreading, we present precise predictions for the minimal size of a dismantling set in a large random grap ...[more]