On the Predictability of Network Robustness from Spectral Measures

Robustness against failure and attack is one of the essential properties of large-scale dynamical system such as power grids, transportation system, communication systems, and computer networks. Despite its popularity and intuitiveness, a major drawback of descriptive robustness metrics such as the size of the largest connected component and the diameter is its computational complexity. On the contrary, predictive metrics such as the spectral radius, the natural connectivity, and the algebraic connectivity are much easier to obtain than descriptive metrics, but the predictability of those measures against different levels and types of failures/attacks has not been well understood. In this paper, we therefore investigate how effectively predictive metrics (spectral measures) can estimate the robustness of a network against random node removal. Our finding includes that, among five types of spectral measures, the effective resistance is most suitable for predicting the largest cluster component size under low node removal ratio, and that the predictability of the effective resistance is stable for various networks generated with different network generation models.

[1]  Leman Akoglu,et al.  Optimizing network robustness by edge rewiring: a general framework , 2016, Data Mining and Knowledge Discovery.

[2]  John S. Baras,et al.  Efficient and robust communication topologies for distributed decision making in networked systems , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[3]  R.E. Kooij,et al.  Robustness of networks against viruses: the role of the spectral radius , 2006, 2006 Symposium on Communications and Vehicular Technology.

[4]  Ryo Nakamura,et al.  A Study on Robustness of Complex Networks Against Random Node Removals , 2018, 2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC).

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

[6]  Chunguang Li,et al.  An evolving network model with community structure , 2005, physics/0510239.

[7]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[8]  Walter Willinger,et al.  Understanding Internet topology: principles, models, and validation , 2005, IEEE/ACM Transactions on Networking.

[9]  Caterina M. Scoglio,et al.  Optimizing algebraic connectivity by edge rewiring , 2013, Appl. Math. Comput..

[10]  Piet Van Mieghem,et al.  On the Robustness of Complex Networks by Using the Algebraic Connectivity , 2008, Networking.

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

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

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

[14]  Paul Erdös,et al.  On random graphs, I , 1959 .

[15]  Anthony H. Dekker,et al.  Network Robustness and Graph Topology , 2004, ACSC.

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