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 complex 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-R

• Type: Conference
• Year: 2008
• Where: NETWORKING
• Authors: A. Jamakovic, Piet Van Mieghem
• Keywords: Algebraic Connectivity, Complex Networks, Computer Networks, Link Connectivity, NETWORKING 2008