Fast Fragmentation of Networks Using Module-Based Attacks

In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from a practical point of view. In this contribution, we present a module-based method to efficiently fragment complex networks. The procedure firstly identifies topological communities through which the network can be represented using a well established heuristic algorithm of community finding. Then only the nodes that participate of inter-community links are removed in descending order of their betweenness centrality. We illustrate the method by applying it to a variety of examples in the social, infrastructure, and biological fields. It is shown that the module-based approach always outperforms targeted attacks to vertices based on node degree or betweenness centrality rankings, with gains in efficiency strongly related to the modularity of the network. Remarkably, in the US power grid case, by deleting 3% of the nodes, the proposed method breaks the original network in fragments which are twenty times smaller in size than the fragments left by betweenness-based attack.

[1]  J. Wojcik,et al.  The protein–protein interaction map of Helicobacter pylori , 2001, Nature.

[2]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[5]  Aidong Zhang,et al.  Bridging Centrality: Identifying Bridging Nodes in Scale-free Networks , 2006 .

[6]  Jian Yang,et al.  Robustness analysis of static routing on networks , 2013 .

[7]  Marcus Kaiser,et al.  Edge vulnerability in neural and metabolic networks , 2004, Biological Cybernetics.

[8]  P. Duijn,et al.  The Relative Ineffectiveness of Criminal Network Disruption , 2014, Scientific Reports.

[9]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[10]  T. Valente.  Network Interventions , 2012, Science.

[11]  Simon A. Dobson,et al.  Resilience of modular complex networks , 2014, ArXiv.

[12]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[13]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[15]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[16]  Marcel Salathé,et al.  Dynamics and Control of Diseases in Networks with Community Structure , 2010, PLoS Comput. Biol..

[17]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Cunlai Pu,et al.  Robustness analysis of network controllability , 2012 .

[19]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[20]  Pasquale De Meo,et al.  On Facebook, most ties are weak , 2012, Commun. ACM.

[21]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[22]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Wei Cui,et al.  Vulnerability of complex networks under path-based attacks , 2015 .

[24]  Hsinchun Chen,et al.  The topology of dark networks , 2008, Commun. ACM.

[25]  Alessandro Vespignani,et al.  Immunization of complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Marc Barthelemy,et al.  Spatial Networks , 2010, Encyclopedia of Social Network Analysis and Mining.

[27]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[28]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

[29]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[31]  Stefan Bornholdt,et al.  Evolution of robust network topologies: Emergence of central backbones , 2012, Physical review letters.

[32]  Carl T. Bergstrom,et al.  The map equation , 2009, 0906.1405.

[33]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[34]  Thomas W. Valente,et al.  Bridging: Locating critical connectors in a network , 2010, Soc. Networks.

[35]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[36]  John E. Hopcroft,et al.  Use of Local Group Information to Identify Communities in Networks , 2015, ACM Trans. Knowl. Discov. Data.

[37]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[38]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[39]  Steve Gregory,et al.  Efficient local behavioral change strategies to reduce the spread of epidemics in networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[41]  V. Latora,et al.  Efficiency of scale-free networks: error and attack tolerance , 2002, cond-mat/0205601.

[42]  E A Leicht,et al.  Suppressing cascades of load in interdependent networks , 2011, Proceedings of the National Academy of Sciences.

[43]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[44]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[45]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.