On the Robustness of Complex Networks by Using the Algebraic Connectivity

The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of networks since it measures the extent to which it is difficult to cut the network into independent components. In this paper we study the behavior of the algebraic connectivity in a well-known complex network model, the Erdos-Renyi random graph. We estimate analytically the mean and the variance of the algebraic connectivity by approximating it with the minimum nodal degree. The resulting estimate improves a known expression for the asymptotic behavior of the algebraic connectivity [18]. Simulations emphasize the accuracy of the analytical estimation, also for small graph sizes. Furthermore, we study the algebraic connectivity in relation to the graph's robustness to node and link failures, i.e. the number of nodes and links that have to be removed in order to disconnect a graph. These two measures are called the node and the link connectivity. Extensive simulations show that the node and the link connectivity converge to a distribution identical to that of the minimal nodal degree, already at small graph sizes. This makes the minimal nodal degree a valuable estimate of the number of nodes or links whose deletion results into disconnected random graph. Moreover, the algebraic connectivity increases with the increasing node and link connectivity, justifies the correctness of our definition that the algebraic connectivity is a measure of the robustness in complex networks.

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

[2]  D. Cvetkovic,et al.  Spectra of graphs : theory and application , 1995 .

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

[4]  Yousef Alavi,et al.  Graph theory, combinatorics, and applications : proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University , 1991 .

[5]  Béla Bollobás,et al.  Random Graphs , 1985 .

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

[7]  B. Bollobás,et al.  Random Graphs of Small Order , 1985 .

[8]  D. Cvetkovic,et al.  Spectra of Graphs: Theory and Applications , 1997 .

[9]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[10]  Matthieu De Beule,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 1999 .

[11]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

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

[13]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[14]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[15]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[16]  P. ERDbS.  ON THE STRENGTH OF CONNECTEDNESS OF A RANDOM GRAPH , 2001 .

[17]  Albert-László Barabási,et al.  Linked: The New Science of Networks , 2002 .

[18]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

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

[20]  Bojan Mohar,et al.  Laplace eigenvalues of graphs - a survey , 1992, Discret. Math..

[21]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[22]  Michael Doob,et al.  Spectra of graphs , 1980 .

[23]  Piet Van Mieghem,et al.  Performance analysis of communications networks and systems , 2006 .

[24]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[25]  D. Watts.  The “New” Science of Networks , 2004 .

[26]  B. Mohar.  Some applications of Laplace eigenvalues of graphs , 1997 .

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

[28]  Ferenc Juhász,et al.  The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs , 1991, Discret. Math..

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

[30]  Steven Skiena,et al.  Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .

[31]  Joao Antonio Pereira,et al.  Linked: The new science of networks , 2002 .

[32]  Miguel Castro,et al.  Should we build Gnutella on a structured overlay? , 2004, Comput. Commun. Rev..

[33]  Jack Dongarra,et al.  Templates for the Solution of Algebraic Eigenvalue Problems , 2000, Software, environments, tools.

[34]  Thomas Fuhrmann,et al.  On the topology of overlay-networks , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[35]  R. Merris.  A survey of graph laplacians , 1995 .

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

[37]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[38]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[39]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

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

[41]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[42]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[43]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .