Efficient network disintegration under incomplete information: the comic effect of link prediction

The study of network disintegration has attracted much attention due to its wide applications, including suppressing the epidemic spreading, destabilizing terrorist network, preventing financial contagion, controlling the rumor diffusion and perturbing cancer networks. The crux of this matter is to find the critical nodes whose removal will lead to network collapse. This paper studies the disintegration of networks with incomplete link information. An effective method is proposed to find the critical nodes by the assistance of link prediction techniques. Extensive experiments in both synthetic and real networks suggest that, by using link prediction method to recover partial missing links in advance, the method can largely improve the network disintegration performance. Besides, to our surprise, we find that when the size of missing information is relatively small, our method even outperforms than the results based on complete information. We refer to this phenomenon as the “comic effect” of link prediction, which means that the network is reshaped through the addition of some links that identified by link prediction algorithms, and the reshaped network is like an exaggerated but characteristic comic of the original one, where the important parts are emphasized.

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

[2]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

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

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

[5]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[6]  Juwen Shen,et al.  Predicting protein–protein interactions based only on sequences information , 2007, Proceedings of the National Academy of Sciences.

[7]  Sophie Ahrens,et al.  Recommender Systems , 2012 .

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

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

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

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

[12]  Kathleen M. Carley.  Destabilization of covert networks , 2006, Comput. Math. Organ. Theory.

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

[14]  Shlomo Havlin,et al.  Improving immunization strategies. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[17]  Linyuan Lü,et al.  Toward link predictability of complex networks , 2015, Proceedings of the National Academy of Sciences.

[18]  Dirk C. Keene.  Acknowledgements , 1975 .

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

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

[21]  A. Barabasi,et al.  Uncovering disease-disease relationships through the incomplete interactome , 2015, Science.

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

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

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

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

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

[27]  Ernesto Estrada,et al.  Food webs robustness to biodiversity loss: the roles of connectance, expansibility and degree distribution. , 2007, Journal of theoretical biology.

[28]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

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

[30]  J. Gómez-Gardeñes,et al.  Immunization of real complex communication networks , 2006 .

[31]  A. Barabasi,et al.  Halting viruses in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Petter Holme,et al.  Efficient local strategies for vaccination and network attack , 2004, q-bio/0403021.

[33]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[34]  Linyuan Lu,et al.  Link prediction based on local random walk , 2010, 1001.2467.

[35]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

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

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

[38]  Linyuan Lu,et al.  SIMILARITY-BASED CLASSIFICATION IN PARTIALLY LABELED NETWORKS , 2010 .

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

[40]  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.

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

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

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

[44]  Xiao Fan Wang,et al.  Complex Networks: Topology, Dynamics and Synchronization , 2002, Int. J. Bifurc. Chaos.

[45]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[46]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[47]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

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

[49]  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.