Generalized network dismantling
From MaRDI portal
Abstract: Finding the set of nodes, which removed or (de)activated can stop the spread of (dis)information, contain an epidemic or disrupt the functioning of a corrupt/criminal organization is still one of the key challenges in network science. In this paper, we introduce the generalized network dismantling problem, which aims to find the set of nodes that, when removed from a network, results in a network fragmentation into subcritical network components at minimum cost. For unit costs, our formulation becomes equivalent to the standard network dismantling problem. Our non-unit cost generalization allows for the inclusion of topological cost functions related to node centrality and non-topological features such as the price, protection level or even social value of a node. In order to solve this optimization problem, we propose a method, which is based on the spectral properties of a novel node-weighted Laplacian operator. The proposed method is applicable to large-scale networks with millions of nodes. It outperforms current state-of-the-art methods and opens new directions in understanding the vulnerability and robustness of complex systems.
Recommendations
- Efficient network dismantling via node explosive percolation
- Method of social network dismantling based on neighbor nodes fusion
- Dismantling complex networks based on the principal eigenvalue of the adjacency matrix
- A derandomized approximation algorithm for the critical node detection problem
- Efficient disintegration strategy in directed networks based on tabu search
Cited in
(15)- Optimal attack strategy of complex networks based on tabu search
- Efficient disintegration strategy in directed networks based on tabu search
- Efficient network disruption under imperfect information: the sharpening effect of network reconstruction with no prior knowledge
- Generalized \(k\)-cores of networks under attack with limited knowledge
- Targeted influence maximization in complex networks
- Method of social network dismantling based on neighbor nodes fusion
- Efficient network dismantling via node explosive percolation
- Power-law distribution of degree-degree distance: a better representation of the scale-free property of complex networks
- Dismantling complex networks based on the principal eigenvalue of the adjacency matrix
- Fragmenting complex network based on non-backtracking matrix
- Bounding robustness in complex networks under topological changes through majorization techniques
- Vital node identification in hypergraphs via gravity model
- Identifying influential nodes in complex networks based on network embedding and local structure entropy
- Hypergraph dismantling with spectral clustering
- Dismantling network by removing weak vertices
This page was built for publication: Generalized network dismantling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222761)
