Work

Spectral centrality measures in complex networks

Year: 2008
Type: article
Abstract: Complex networks are characterized by heterogeneous distributions of the degree of nodes, which produce a large diversification of the roles of the nodes within the network. Several centrality measures have been introduced to rank nodes based on their topological importance within a graph. Here we review and compare centrality measures based on spectral properties of graph matrices. We shall focus on PageRank (PR), eigenvector centrality (EV), and the hub and authority scores of the HITS algorithm. We derive simple relations between the measures and the (in)degree of the nodes, in some limits. We also compare the rankings obtained with different centrality measures.
Language: English
Open Access status: green
OpenAlex ID: W2007785292
FWCI: 3.12
Cites: 26
Cited by: 184
Related to: 10