Inconsistencies Among Spectral Robustness Metrics
X. Wang (TU Delft - Mathematical Physics)
L Feng (A*STAR Computational Resource Centre (A*CRC))
R.E. Kooij (Singapore University of Technology and Design, TU Delft - Network Architectures and Services)
Jose L. Marzo (University of Girona)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Network robustness plays a critical role in the proper functioning of modern society. It is common practice to use spectral metrics, to quantify the robustness of networks. In this paper we compare eight different spectral metrics that quantify network robustness. Four of the metrics are derived from the adjacency matrix, the others follow from the Laplacian spectrum. We found that the metrics can give inconsistent indications, when comparing the robustness of different synthetic networks. Then, we calculate and compare the spectral metrics for a number of real-world networks, where inconsistencies still occur, but to a lesser extent. Finally, we indicate how the concept of the R∗-value, a weighted sum of robustness metrics, can be used to resolve the found inconsistencies.