Efficient disintegration strategy in directed networks based on tabu search

Abstract The problem of network disintegration, which aims at identifying the critical nodes or edges whose removal will lead to a network collapse, has attracted much attention due to its wide applications. This paper focuses on the disintegration of directed networks. We propose a disintegration strategy based on tabu search. Experiments show that the disintegration effect of our strategy is obviously better than those of typical disintegration strategies based on local structural properties. Moreover, we find that the critical nodes identified to remove in directed networks are not those nodes with large degree or betweenness centrality that always are the crucial properties in undirected network.

[1]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[2]  Petter Holme,et al.  Onion structure and network robustness , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Abhijit Sarkar,et al.  Two-peak and three-peak optimal complex networks. , 2004, Physical review letters.

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

[5]  H. Stanley,et al.  Robustness of network of networks under targeted attack. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[7]  Hongzhong Deng,et al.  Vulnerability of complex networks under intentional attack with incomplete information , 2007 .

[8]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Michele Bellingeri,et al.  Efficiency of attack strategies on complex model and real-world networks , 2013, ArXiv.

[10]  Teruyoshi Kobayashi,et al.  Efficient immunization strategies to prevent financial contagion , 2013, Scientific Reports.

[11]  Albert-László Barabási,et al.  Universal resilience patterns in complex networks , 2016, Nature.

[12]  H. Milward,et al.  Dark Networks as Problems , 2003 .

[13]  Hiroki Sayama,et al.  Optimization of robustness and connectivity in complex networks. , 2003, Physical review letters.

[14]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[15]  Mauricio Barahona,et al.  Spectral Measure of Structural Robustness in Complex Networks , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[16]  Mostafa Salehi,et al.  A local immunization strategy for networks with overlapping community structure , 2017 .

[17]  Shlomo Havlin,et al.  Suppressing epidemics with a limited amount of immunization units. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Hai-Jun Zhou,et al.  Identifying optimal targets of network attack by belief propagation , 2016, Physical review. E.

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

[21]  Shlomo Havlin,et al.  Finding a better immunization strategy. , 2008, Physical review letters.

[22]  Sameep Mehta,et al.  A study of rumor control strategies on social networks , 2010, CIKM.

[23]  Xin Lu,et al.  Efficient network disintegration under incomplete information: the comic effect of link prediction , 2016, Scientific reports.

[24]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[25]  Asim S. Siddiqui,et al.  Preferential network perturbation , 2006 .

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

[27]  Wu Jun,et al.  Natural Connectivity of Complex Networks , 2010 .

[28]  S. Havlin,et al.  Optimization of robustness of complex networks , 2004, cond-mat/0404331.

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

[30]  H. Stanley,et al.  Networks formed from interdependent networks , 2011, Nature Physics.

[31]  Jian-Guo Liu,et al.  Optimization of Robustness of Scale-Free Network to Random and Targeted Attacks , 2005 .

[32]  R. Linsker,et al.  Improving network robustness by edge modification , 2005 .

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

[34]  Wu Jun,et al.  Optimal Attack Strategy in Random Scale-Free Networks Based on Incomplete Information , 2011 .

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

[36]  Hans J. Herrmann,et al.  Onion-like network topology enhances robustness against malicious attacks , 2011 .

[37]  Amos Maritan,et al.  Size and form in efficient transportation networks , 1999, Nature.

[38]  Jun Wu,et al.  Optimal attack strategy of complex networks based on tabu search , 2016 .