文摘
The weighted spectral distribution (WSD) is a measure defined on the normalized Laplacian spectrum. It can be used for comparing complex networks with different sizes (number of nodes) and provides a sensitive discrimination of the structural robustness of complex networks. In this paper, we design an algorithm for the accurate calculation of the WSD in large-scale complex networks by utilizing characteristics of the graph structure. As an extension to Sylvester’s Law of Inertia for the calculation of the WSD based on spectral characteristics, our algorithm exhibits a higher time efficiency when applied to large-scale complex networks.