Projects per year
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.
Original language | English |
---|---|
Pages (from-to) | 159-185 |
Number of pages | 27 |
Journal | Linear Algebra and its Applications |
Volume | 655 |
Early online date | 28 Aug 2022 |
DOIs | |
Publication status | Published - 15 Dec 2022 |
Keywords
- complex network
- matrix function
- centrality measures
- temporal network
- Katz centrality
Fingerprint
Dive into the research topics of 'Dynamic Katz and related network measures'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Don't look back -- non-backtracking walks in complex networks (ECF)
1/05/19 → 30/04/22
Project: Research Fellowship