Graph measures and network robustness

Abstract

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.

References in corpus (1)

• Spectral Measure of Robustness in Complex Networks

Cited by in corpus (12)

• Graph Vulnerability and Robustness: A Survey
• Structural Robustness of Complex Networks: A Survey of A Posteriori Measures
• K-Core Minimization: A Game Theoretic Approach
• Measures and Optimization for Robustness and Vulnerability in Disconnected Networks
• The Minimum Edge Compact Spanner Network Design Problem
• Scalable Graph Neural Network-based framework for identifying critical nodes and links in Complex Networks
• Curious properties of latency distributions
• Analysis of Network Robustness for Finite Sized Wireless Sensor Networks
• Measuring Network Robustness by Average Network Flow
• Consensus, Cohesion and Connectivity
• Efficient Network Analysis Under Single Link Deletion
• Node package manager's dependency network robustness