Graph measures and network robustness

Network robustness research aims at finding a measure to quantify network robustness. Once such a measure has been established, we will be able to compare networks, to improve existing networks and to design new networks that are able to continue to perform well when it is subject to failures or attacks. In this paper we survey a large amount of robustness measures on simple, undirected and unweighted graphs, in order to offer a tool for network administrators to evaluate and improve the robustness of their network. The measures discussed in this paper are based on the concepts of connectivity (including reliability polynomials), distance, betweenness and clustering. Some other measures are notions from spectral graph theory, more precisely, they are functions of the Laplacian eigenvalues. In addition to surveying these graph measures, the paper also contains a discussion of their functionality as a measure for topological network robustness.

[1]  Aaron D. Wyner,et al.  Reliable Circuits Using Less Reliable Relays , 1993 .

[2]  Yaron Singer,et al.  Dynamic Measure of Network Robustness , 2006, 2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel.

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

[4]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[5]  Daryl D. Harms,et al.  Reliability polynomials can cross twice , 1993 .

[6]  Robert E. Kooij,et al.  ELASTICITY: Topological Characterization of Robustness in Complex Networks , 2008, BIONETICS.

[7]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

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

[9]  R. Kooij,et al.  A Framework for Computing Topological Network Robustness , 2010 .

[10]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[11]  Bin Liu,et al.  Spectral Measure of Robustness in Complex Networks , 2008 .

[12]  F. Spieksma,et al.  Effective graph resistance , 2011 .

[13]  W. Ellens.  Effective resistance and other graph measures for network robustness , 2011 .

[14]  V. Latora,et al.  A measure of centrality based on network efficiency , 2004, cond-mat/0402050.

[15]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

[16]  H. Wiener.  Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.

[17]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[18]  M. Randic,et al.  Resistance distance , 1993 .

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

[20]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

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