Community Detection Boosts Network Dismantling on Real-World Networks

Network dismantling techniques have gained increasing interest during the last years caused by the need for protecting and strengthening critical infrastructure systems in our society. We show that communities play a critical role in dismantling, given their inherent property of separating a network into strongly and weakly connected parts. The process of community-based dismantling depends on several design factors, including the choice of community detection method, community cut strategy, and inter-community node selection. We formalize the problem of community attacks to networks, identify critical design decisions for such methods, and perform a comprehensive empirical evaluation with respect to effectiveness and efficiency criteria on a set of more than 40 community-based network dismantling methods. We compare our results to state-of-the-art network dismantling, including collective influence, articulation points, as well as network decycling. We show that community-based network dismantling significantly outperforms existing techniques in terms of solution quality and computation time in the vast majority of real-world networks, while existing techniques mainly excel on model networks (ER, BA) mostly. We additionally show that the scalability of community-based dismantling opens new doors towards the efficient analysis of large real-world networks.

[1]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Yusoon Kim,et al.  Supply network disruption and resilience: A network structural perspective , 2015 .

[3]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

[4]  R Zecchina,et al.  Large deviations of cascade processes on graphs. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Jun Zhang,et al.  Evolution of domestic airport networks: a review and comparative analysis , 2019 .

[6]  Santo Fortunato,et al.  Community detection in networks: Structural communities versus ground truth , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Hawoong Jeong,et al.  Modeling the Internet's large-scale topology , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[8]  D. Newth,et al.  Optimizing complex networks for resilience against cascading failure , 2007 .

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

[10]  Dirk Brockmann,et al.  Fundamental properties of cooperative contagion processes , 2016 .

[11]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

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

[14]  Jing Liu,et al.  Designing comprehensively robust networks against intentional attacks and cascading failures , 2019, Inf. Sci..

[15]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[16]  Shlomo Havlin,et al.  Percolation of hierarchical networks and networks of networks , 2018, Physical Review E.

[17]  Xiaoqian Sun,et al.  Worldwide Railway Skeleton Network: Extraction Methodology and Preliminary Analysis , 2017, IEEE Transactions on Intelligent Transportation Systems.

[18]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[19]  Volker Gollnick,et al.  Robustness analysis metrics for worldwide airport network: A comprehensive study , 2017 .

[20]  Hans J. Herrmann,et al.  Revealing the structure of the world airline network , 2014, Scientific Reports.

[21]  N. Madar,et al.  Immunization and epidemic dynamics in complex networks , 2004 .

[22]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[23]  Amir Bashan,et al.  Articulation points in complex networks , 2016, Nature Communications.

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

[25]  Jie Cao,et al.  Enhance the Performance of Network Computation by a Tunable Weighting Strategy , 2018, IEEE Transactions on Emerging Topics in Computational Intelligence.

[26]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

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

[28]  Guilhem Semerjian,et al.  Network dismantling , 2016, Proceedings of the National Academy of Sciences.

[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]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Harry Eugene Stanley,et al.  Robustness of interdependent networks under targeted attack , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[33]  Aihua Li,et al.  Graph K-means Based on Leader Identification, Dynamic Game, and Opinion Dynamics , 2020, IEEE Transactions on Knowledge and Data Engineering.

[34]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[35]  Riccardo Zecchina,et al.  Optimizing spread dynamics on graphs by message passing , 2012, 1203.1426.

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

[37]  Alex Arenas,et al.  Analysis of the structure of complex networks at different resolution levels , 2007, physics/0703218.

[38]  Hui-Jia Li,et al.  Social significance of community structure: Statistical view , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

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

[41]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

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

[43]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[44]  Ulises Cortés,et al.  Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm , 2017, COMPLEX NETWORKS.

[45]  Peter Grassberger,et al.  Avalanche outbreaks emerging in cooperative contagions , 2015, Nature Physics.

[46]  Dirk Helbing,et al.  Generalized network dismantling , 2018, Proceedings of the National Academy of Sciences.

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

[48]  S. Strogatz.  Exploring complex networks , 2001, Nature.

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

[50]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[51]  R. Lambiotte,et al.  Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks , 2008, IEEE Transactions on Network Science and Engineering.

[52]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[53]  Jing Liu,et al.  Community robustness and its enhancement in interdependent networks , 2019, Appl. Soft Comput..

[54]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[55]  Michael Boss,et al.  Network topology of the interbank market , 2003, cond-mat/0309582.

[56]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[57]  Leto Peel,et al.  The ground truth about metadata and community detection in networks , 2016, Science Advances.

[58]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[59]  Shlomo Havlin,et al.  Recent Progress on the Resilience of Complex Networks , 2015 .

[60]  Hernán A. Makse,et al.  Collective Influence Algorithm to find influencers via optimal percolation in massively large social media , 2016, Scientific Reports.

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

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

[63]  Peter Brooker.  Fear in a handful of dust: aviation and the Icelandic volcano , 2010 .

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

[65]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[66]  Jie Cao,et al.  Dynamical Clustering in Electronic Commerce Systems via Optimization and Leadership Expansion , 2020, IEEE Transactions on Industrial Informatics.