A New Framework for Network Disruption

Traditional network disruption approaches focus on disconnecting or lengthening paths in the network. We present a new framework for network disruption that attempts to reroute flow through critical vertices via vertex deletion, under the assumption that this will render those vertices vulnerable to future attacks. We define the load on a critical vertex to be the number of paths in the network that must flow through the vertex. We present graph-theoretic and computational techniques to maximize this load, firstly by removing either a single vertex from the network, secondly by removing a subset of vertices.

[1]  David P. Morton,et al.  Stochastic Network Interdiction , 1998, Oper. Res..

[2]  Johannes O. Royset,et al.  Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem , 2007, INFORMS J. Comput..

[3]  M. Newman,et al.  Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[4]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[5]  Reuven Cohen,et al.  Stability and topology of scale-free networks under attack and defense strategies. , 2005, Physical review letters.

[6]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[7]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[8]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[9]  David Shallcross,et al.  Practical Issues and Algorithms for Analyzing Terrorist Networks 1 , 2002 .

[10]  Valdis E. Krebs,et al.  Mapping Networks of Terrorist Cells , 2001 .

[11]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

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

[13]  Carlo Morselli,et al.  The Efficiency/Security Trade-Off in Criminal Networks , 2007, Soc. Networks.

[14]  Duncan J. Watts,et al.  Six Degrees: The Science of a Connected Age , 2003 .

[15]  Robert B. Ellis,et al.  A network diversion vulnerability problem , 2001 .

[16]  Cynthia A. Phillips,et al.  The network inhibition problem , 1993, STOC.

[17]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[18]  Richard Rothenberg,et al.  From Whole Cloth : Making up the terrorist network , 2002 .

[19]  Adilson E Motter,et al.  Cascade-based attacks on complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[21]  Jacek Rak,et al.  On Certain Behavior of Scale-Free Networks Under Malicious Attacks , 2006, SAFECOMP.

[22]  S. Low,et al.  The "robust yet fragile" nature of the Internet. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[23]  Valdis E. Krebs,et al.  Uncloaking Terrorist Networks , 2002, First Monday.

[24]  Hsinchun Chen,et al.  Analyzing Terrorist Networks: A Case Study of the Global Salafi Jihad Network , 2005, ISI.

[25]  Alan W. McMasters,et al.  Optimal interdiction of a supply network , 1970 .

[26]  Zengqiang Chen,et al.  Error and attack tolerance of evolving networks with local preferential attachment , 2007 .

[27]  Destabilizing networks , 2002 .

[28]  H. Stanley,et al.  Resilience of complex networks to random breakdown. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  D. Watts.  A twenty-first century science , 2007, Nature.

[30]  Jeffrey C. Johnson,et al.  Communication Roles, Perceived Effectiveness, and Satisfaction in an Environmental Management Program , 1998, Comput. Math. Organ. Theory.

[31]  M. Newman,et al.  Mean-field solution of the small-world network model. , 1999, Physical review letters.

[32]  Norman D. Curet,et al.  The Network Diversion Problem , 2001 .

[33]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Hsinchun Chen,et al.  Collecting and Analyzing the Presence of Terrorists on the Web: A Case Study of Jihad Websites , 2005, ISI.

[35]  Reuven Cohen,et al.  Attack Strategies on Complex Networks , 2006, International Conference on Computational Science.

[36]  Alan M. Frieze,et al.  Adversarial deletion in a scale free random graph process , 2005, SODA '05.

[37]  Evelyne de Leuw,et al.  Connecting the dots , 1999, Nature Genetics.

[38]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

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

[40]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[41]  Özlem Ergun,et al.  The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability , 2010, Oper. Res. Lett..

[42]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

[43]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[44]  David L. Hicks,et al.  Notice of Violation of IEEE Publication PrinciplesDetecting high-value individuals in covert networks: 7/7 London bombing case study , 2008, 2008 IEEE/ACS International Conference on Computer Systems and Applications.

[45]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[48]  Kurt Mehlhorn,et al.  An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow , 1999, Inf. Process. Lett..

[49]  Marc Sageman,et al.  Understanding terror networks. , 2004, International journal of emergency mental health.

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

[51]  Reuven Cohen,et al.  Tolerance of scale-free networks: from friendly to intentional attack strategies , 2004 .

[52]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .

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

[54]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[55]  Nong Ye,et al.  Tolerance of scale-free networks against attack-induced cascades. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[56]  Massimo Marchiori,et al.  Model for cascading failures in complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[57]  Mark Newman,et al.  Models of the Small World , 2000 .

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

[59]  D. Watts.  Networks, Dynamics, and the Small‐World Phenomenon1 , 1999, American Journal of Sociology.

[60]  Anne.  FINDING THE n MOST VITAL LINKS IN FLOW NETWORKS , 2022 .

[61]  Alan T. Murray,et al.  Comparative Approaches for Assessing Network Vulnerability , 2008 .