Make It or Break It: Manipulating Robustness in Large Networks

The function and performance of networks rely on their robustness, defined as their ability to continue functioning in the face of damage (targeted attacks or random failures) to parts of the network. Prior research has proposed a variety of measures to quantify robustness and various manipulation strategies to alter it. In this paper, our contributions are twofold. First, we critically analyze various robustness measures and identify their strengths and weaknesses. Our analysis suggests natural connectivity, based on the weighted count of loops in a network, to be a reliable measure. Second, we propose the first principled manipulation algorithms that directly optimize this robustness measure, which lead to significant performance improvement over existing, ad-hoc heuristic solutions. Extensive experiments on real-world datasets demonstrate the effectiveness and scalability of our methods against a long list of competitor strategies.

[1]  Michalis Faloutsos,et al.  Gelling, and melting, large graphs by edge manipulation , 2012, CIKM.

[2]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[3]  M. Krishnamoorthy,et al.  Fault diameter of interconnection networks , 1987 .

[4]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

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

[6]  M. Randic,et al.  On Characterization of 3D Molecular Structure , 2002 .

[7]  Cecilia Mascolo,et al.  Evaluating Temporal Robustness of Mobile Networks , 2013, IEEE Transactions on Mobile Computing.

[8]  Michele Benzi,et al.  The Physics of Communicability in Complex Networks , 2011, ArXiv.

[9]  Mark S. Granovetter Economic Action and Social Structure: The Problem of Embeddedness , 1985, American Journal of Sociology.

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

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

[12]  I. Frisch,et al.  Analysis and Design of Survivable Networks , 1970 .

[13]  Victor Y. Pan,et al.  The complexity of the matrix eigenproblem , 1999, STOC '99.

[14]  Vasek Chvátal,et al.  Tough graphs and hamiltonian circuits , 1973, Discret. Math..

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

[16]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[17]  Vladimir Nikiforov,et al.  Some Inequalities for the Largest Eigenvalue of a Graph , 2002, Combinatorics, Probability and Computing.

[18]  C. Lanczos An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

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

[20]  Nikhil Srivastava,et al.  Graph sparsification by effective resistances , 2008, SIAM J. Comput..

[21]  Myeong-Kwan Kevin Cheon,et al.  Frank and I , 2012 .

[22]  V. N. Bogaevski,et al.  Matrix Perturbation Theory , 1991 .

[23]  H. A. Jung,et al.  On a class of posets and the corresponding comparability graphs , 1978, J. Comb. Theory B.

[24]  Ernesto Estrada,et al.  Network robustness to targeted attacks. The interplay of expansibility and degree distribution , 2006 .

[25]  Mark S. Granovetter Economic Action and Social Structure: The Problem of Embeddedness , 1985, American Journal of Sociology.

[26]  Shang Yi-Lun Local Natural Connectivity in Complex Networks , 2011 .

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

[28]  Christos Faloutsos,et al.  Fast Robustness Estimation in Large Social Graphs: Communities and Anomaly Detection , 2012, SDM.

[29]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[30]  F. R. Gantmakher The Theory of Matrices , 1984 .

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