Dynamic Katz and related network measures

Francesca Arrigo, Desmond J. Higham, Vanni Noferini, Ryan Wood*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)
17 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)159-185
Number of pages27
JournalLinear Algebra and Its Applications
Publication statusPublished - 15 Dec 2022
MoE publication typeA1 Journal article-refereed


  • Centrality measure
  • Complex network
  • Katz centrality
  • Matrix function
  • Temporal network


Dive into the research topics of 'Dynamic Katz and related network measures'. Together they form a unique fingerprint.

Cite this