You are here: MIMS > EPrints
MIMS EPrints

2015.3: Matching Exponential-Based and Resolvent-Based Centrality Measures

2015.3: Mary Aprahamian, Desmond J. Higham and Nicholas J. Higham (2016) Matching Exponential-Based and Resolvent-Based Centrality Measures. Journal of Complex Networks, 4 (2). pp. 157-176.

This is the latest version of this eprint.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
1064 Kb

DOI: 10.1093/comnet/cnv016


The relative importance of nodes in a network can be quantified via functions of the adjacency matrix. Two popular choices of function are the exponential, which is parameter-free, and the resolvent function, which yields the Katz centrality measure. Katz centrality can be the more computationally efficient, especially for large directed networks, and has the benefit of generalizing naturally to time-dependent network sequences, but it depends on a parameter. We give a prescription for selecting the Katz parameter based on the objective of matching the centralities of the exponential counterpart. For our new choice of parameter the resolvent can be very ill conditioned, but we argue that the centralities computed in floating point arithmetic can nevertheless reliably be used for ranking. Experiments on \revised{six} real networks show that the new choice of Katz parameter leads to rankings of nodes that \revised{generally} match those from the exponential centralities well in practice.

Item Type:Article
Uncontrolled Keywords:Katz centrality; Katz parameter; adjacency matrix; matrix exponential; matrix resolvent; network analysis; inverse iteration; condition number
Subjects:MSC 2000 > 05 Combinatorics
MSC 2000 > 15 Linear and multilinear algebra; matrix theory
MSC 2000 > 65 Numerical analysis
MIMS number:2015.3
Deposited By:Nick Higham
Deposited On:07 October 2016

Available Versions of this Item

Download Statistics: last 4 weeks
Repository Staff Only: edit this item