Robustness of network attack strategies against node sampling and link errors

We investigate the effectiveness of network attack strategies when the attacker has only imperfect information about the network. While most existing network attack strategies assume complete knowledge about the network, in reality it is difficult to obtain the complete structure of a large-scale complex network. This paper considers two scenarios in which the available network information is imperfect. In one scenario, the network contains link errors (i.e., missing and false links) due to measurement errors, and in the other scenario the target network is so large that only part of the network structure is available from network sampling. Through extensive simulations, we show that particularly in a network with highly skewed degree distribution, network attack strategies are robust against link errors. Even if the network contains 30% false links and missing links, the strategies are just as effective as when the complete network is available. We also show that the attack strategies are far less effective when the network is obtained from random sampling, whereas the detrimental effects of network sampling on network attack strategies are small when using biased sampling strategies such as breadth-first search, depth-first search, and sample edge counts. Moreover, the effectiveness of network attack strategies is examined in the context of network immunization, and the implications of the results are discussed.

[1]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[2]  Kun Zhao,et al.  New attack strategies for complex networks , 2015 .

[3]  Jure Leskovec,et al.  Measurement error in network data: A re-classification , 2012, Soc. Networks.

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

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

[6]  Yi Lin,et al.  Vulnerability of complex networks under three-level-tree attacks , 2016 .

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

[8]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[9]  Michelle Girvan,et al.  The Impact of Imperfect Information on Network Attack , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Michelle Girvan,et al.  Interpreting Patterns of Gene Expression: Signatures of Coregulation, the Data Processing Inequality, and Triplet Motifs , 2012, PloS one.

[11]  Hans J. Herrmann,et al.  Inverse targeting —An effective immunization strategy , 2011, ArXiv.

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

[13]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[14]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[15]  Eric Gilbert,et al.  Predicting tie strength with social media , 2009, CHI.

[16]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[17]  A. Louisa,et al.  コロイド混合体における有効力 空乏引力から集積斥力へ | 文献情報 | J-GLOBAL 科学技術総合リンクセンター , 2002 .

[18]  Terrill L. Frantz,et al.  Robustness of centrality measures under uncertainty: Examining the role of network topology , 2009, Comput. Math. Organ. Theory.

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

[20]  Dawei Zhao,et al.  Statistical physics of vaccination , 2016, ArXiv.

[21]  Kathleen M. Carley,et al.  On the robustness of centrality measures under conditions of imperfect data , 2006, Soc. Networks.

[22]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

[23]  Hiroyuki Ohsaki,et al.  On the robustness of centrality measures against link weight quantization in social networks , 2015, Comput. Math. Organ. Theory.

[24]  Nicole Immorlica,et al.  Maximizing Influence in an Unknown Social Network , 2018, AAAI.

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

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

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

[28]  Tanya Y. Berger-Wolf,et al.  Benefits of bias: towards better characterization of network sampling , 2011, KDD.

[29]  Sho Tsugawa,et al.  Identifying influencers from sampled social networks , 2018, Physica A: Statistical Mechanics and its Applications.

[30]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.