Complex networks vulnerability to module-based attacks

Abstract

In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from practical points of view. In this contribution we present a module-based method to efficiently break complex networks. The procedure first identifies the communities in which the network can be represented, then it deletes the nodes (edges) that connect different modules by its order in the betweenness centrality ranking list. We illustrate the method by applying it to various well known examples of social, infrastructure, and biological networks. We show that the proposed method always outperforms vertex (edge) attacks which are based on the ranking of node (edge) degree or centrality, with a huge gain in efficiency for some examples. Remarkably, for the US power grid, the present method breaks the original network of 4941 nodes to many fragments smaller than 197 nodes (4% of the original size) by removing mere 164 nodes (~3%) identified by the procedure. By comparison, any degree or centrality based procedure, deleting the same amount of nodes, removes only 22% of the original network, i.e. more than 3800 nodes continue to be connected after that

8 pages, 8 figures

References in corpus (9)

• Fast unfolding of communities in large networks
• Modularity and community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Efficient Immunization Strategies for Computer Networks and Populations
• Mitigation of Malicious Attacks on Networks
• Robust network community detection using balanced propagation
• Edge vulnerability in neural and metabolic networks
• Evolution of robust network topologies: Emergence of central backbones
• Resilience of modular complex networks

Cited by in corpus (17)

• Structural Robustness of Complex Networks: A Survey of A Posteriori Measures
• Measuring Node Contribution to Community Structure with Modularity Vitality
• Resilience of Networks Formed of Interdependent Modular Networks
• The web of federal crimes in Brazil: topology, weaknesses, and control
• Underestimated cost of targeted attacks on complex networks
• A Framework of Hierarchical Attacks to Network Controllability
• Percolation on feature-enriched interconnected systems
• A complex network approach to political analysis: application to the Brazilian Chamber of Deputies
• Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks
• Cyber Network Resilience against Self-Propagating Malware Attacks
• Evidence of Fraud in Brazil's Electoral Campaigns Via the Benford's Law
• Fragmenting networks by targeting collective influencers at a mesoscopic level
• Emergence of coexisting percolating clusters in networks
• Performance of attack strategies on modular networks
• Fragility and anomalous susceptibility of weakly interacting networks
• Universal vulnerability in strong modular networks with various degree distributions between inequality and equality
• Empirical determination of the optimum attack for fragmentation of modular networks