Skip navigation

Spectral centrality measures in complex networks

Spectral centrality measures in complex networks

Perra, Nicola and Fortunato, Santo (2008) Spectral centrality measures in complex networks. Physical Review E, 78 (3):036107. ISSN 2470-0053 (Print), 2470-0045 (Online) (doi:https://doi.org/10.1103/PhysRevE.78.036107)

Full text not available from this repository.

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.

Item Type: Article
Uncontrolled Keywords: Centrality measures in networks
Faculty / Department / Research Group: Faculty of Business
Faculty of Business > Centre for Business Network Analysis (CBNA)
Faculty of Business > Networks and Urban Systems Centre (NUSC) > Centre for Business Network Analysis (CBNA)
Faculty of Business > Department of International Business & Economics
Last Modified: 11 Jan 2017 12:17
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: None
URI: http://gala.gre.ac.uk/id/eprint/14954

Actions (login required)

View Item View Item