On spectral analysis of node centralities

In this paper, we study spectral properties of node centralities such as degree, closeness, and betweenness centralities, by utilizing graph Fourier transform. We consider node centralities as signals on various networks, namely, regular, random, small-world, and scale-free networks. The spectral analysis helps us to easily understand centrality patterns over various networks. We observe spectral patterns for different network models and subsequently classify networks from the spectra of node centralities.