Ensemble approach for generalized network dismantling

Abstract

Finding a set of nodes in a network, whose removal fragments the network below some target size at minimal cost is called network dismantling problem and it belongs to the NP-hard computational class. In this paper, we explore the (generalized) network dismantling problem by exploring the spectral approximation with the variant of the power-iteration method. In particular, we explore the network dismantling solution landscape by creating the ensemble of possible solutions from different initial conditions and a different number of iterations of the spectral approximation.

arXiv comment11 Pages, 4 Figures, 4 Tables

References in corpus (12)

• Epidemic processes in complex networks
• Breakdown of the Internet under intentional attack
• Immunization of complex networks
• Influence maximization in complex networks through optimal percolation
• Mitigation of Malicious Attacks on Networks
• The performance of modularity maximization in practical contexts
• Network dismantling
• Generalized Network Dismantling
• Identifying optimal targets of network attack by belief propagation
• Spin glass approach to the feedback vertex set problem
• Exploring the solution landscape enables more reliable network community detection
• Underestimated cost of targeted attacks on complex networks