Dynamic Katz and related network measures
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2022-12-15
Major/Subject
Mcode
Degree programme
Language
en
Pages
27
Series
Linear Algebra and Its Applications, Volume 655, pp. 159-185
Abstract
We study walk-based centrality measures for time-ordered network sequences. For the case of standard dynamic walk-counting, we show how to derive and compute centrality measures induced by analytic functions. We also prove that dynamic Katz centrality, based on the resolvent function, has the unique advantage of allowing computations to be performed entirely at the node level. We then consider two distinct types of backtracking and develop a framework for capturing dynamic walk combinatorics when either or both is disallowed.Description
Funding Information: The work of F.A. was supported by fellowship ECF-2018-453 from the Leverhulme Trust.The work of D.J.H. was supported the Engineering and Physical Sciences Research Council Grants EP/P020720/1 and EP/V046527/1.The work of V.N. and R.W. was supported by an Academy of Finland grant (Suomen Akatemian päätös 331240). Publisher Copyright: © 2022 The Authors
Keywords
Centrality measure, Complex network, Katz centrality, Matrix function, Temporal network
Other note
Citation
Arrigo, F, Higham, D J, Noferini, V & Wood, R 2022, ' Dynamic Katz and related network measures ', Linear Algebra and Its Applications, vol. 655, pp. 159-185 . https://doi.org/10.1016/j.laa.2022.08.022