Unknown

Dataset Information

0

Generalized network dismantling.


ABSTRACT: Finding an optimal subset of nodes in a network that is able to efficiently disrupt the functioning of a corrupt or criminal organization or contain an epidemic or the spread of misinformation is a highly relevant problem of network science. In this paper, we address the generalized network-dismantling problem, which aims at finding a set of nodes whose removal from the network results in the fragmentation of the network into subcritical network components at minimal overall cost. Compared with previous formulations, we allow the costs of node removals to take arbitrary nonnegative real values, which may depend on topological properties such as node centrality or on nontopological features such as the price or protection level of a node. Interestingly, we show that nonunit costs imply a significantly different dismantling strategy. To solve this optimization problem, we propose a method which is based on the spectral properties of a node-weighted Laplacian operator and combine it with a fine-tuning mechanism related to the weighted vertex cover problem. The proposed method is applicable to large-scale networks with millions of nodes. It outperforms current state-of-the-art methods and opens more directions for understanding the vulnerability and robustness of complex systems.

SUBMITTER: Ren XL 

PROVIDER: S-EPMC6452684 | biostudies-literature | 2019 Apr

REPOSITORIES: biostudies-literature

altmetric image

Publications

Generalized network dismantling.

Ren Xiao-Long XL   Gleinig Niels N   Helbing Dirk D   Antulov-Fantulin Nino N  

Proceedings of the National Academy of Sciences of the United States of America 20190315 14


Finding an optimal subset of nodes in a network that is able to efficiently disrupt the functioning of a corrupt or criminal organization or contain an epidemic or the spread of misinformation is a highly relevant problem of network science. In this paper, we address the generalized network-dismantling problem, which aims at finding a set of nodes whose removal from the network results in the fragmentation of the network into subcritical network components at minimal overall cost. Compared with  ...[more]

Similar Datasets

| S-EPMC5098660 | biostudies-literature
| S-EPMC6124095 | biostudies-other
| S-EPMC4989114 | biostudies-literature
| S-EPMC6137372 | biostudies-other
| S-EPMC9379379 | biostudies-literature
| S-EPMC7509173 | biostudies-literature
| S-EPMC5850286 | biostudies-literature
| S-EPMC6158757 | biostudies-literature
| S-EPMC5126572 | biostudies-literature
| S-EPMC7854587 | biostudies-literature