Edge-based Katz centralities for spatio-temporal multiplex networks
Abstract
Katz centrality is a well-established measure to identify and rank the most important nodes in complex networks by means of a linear system solve. Recent works have developed notions of Katz centrality for temporal, i.e., time-evolving networks. Their drawback is that small changes in the network structure may drastically change centralities across large parts of the network. Moreover, an unproportional effort in the network science community has been devoted to the study of node-based quantities while edge-based measures are far less explored. In this manuscript, we introduce a novel failure-aware temporal multiplex network model for computing edge-based Katz centralities for spatial networks. This class of networks admits the use of the line graph as network representation. We use a block-triangular and -banded supra-adjacency matrix representation, modeling inter-layer connections as low-rank matrices, which assigns a spatially constrained emphasis on up- or downdated edges. These could represent, e.g., breakages of water/gas pipes or obstructions in street networks in real-time infrastructure monitoring applications. We analyze the structure of the of the block matrix inverse with respect to entry decay in the blocks above the block-diagonal. This gives rise to two truncation approaches that allow drastic computational runtime reductions at the cost of introducing a controlled truncation error. Numerical experiments on a range of real-world spatio-temporal networks of size up to 2· 108 illustrate accuracy and efficiency with runtime gains of up to a factor of $679$.
Related
- Spectral clustering of time-evolving networks using spatio-temporal random walks
- Automated Detection of Match Phases in Football from Spatio-Temporal Tracking Data Using Graph Neural Networks
- A Non-Stationary Spatio-Temporal Covariance Model with Dynamic Advection Effects for Rainfall Data
- A case study of hybrid statistical models for analyzing spatio-temporal effects in historical map series of Donau-Ries county
- glmSTARMA -- An R-Package for fitting autoregressive spatio-temporal models following generalized linear models
BibTeX
@misc{bergermann2026edgebased,
title = {{Edge-based Katz centralities for spatio-temporal multiplex networks}},
author = {Kai Bergermann and Francesco Gravili and Valeria Simoncini and Martin Stoll},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.24638},
eprint = {2609.24638},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.24638},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Edge-based Katz centralities for spatio-temporal multiplex networks
AU - Kai Bergermann
AU - Francesco Gravili
AU - Valeria Simoncini
AU - Martin Stoll
PY - 2026
DA - 2026/09/23
PB - arXiv
DO - 10.48550/arxiv.2609.24638
UR - https://arxiv.org/abs/2609.24638
AB - Katz centrality is a well-established measure to identify and rank the most important nodes in complex networks by means of a linear system solve. Recent works have developed notions of Katz centrality for temporal, i.e., time-evolving networks. Their drawback is that small changes in the network structure may drastically change centralities across large parts of the network. Moreover, an unproportional effort in the network science community has been devoted to the study of node-based quantities while edge-based measures are far less explored. In this manuscript, we introduce a novel failure-aware temporal multiplex network model for computing edge-based Katz centralities for spatial networks. This class of networks admits the use of the line graph as network representation. We use a block-triangular and -banded supra-adjacency matrix representation, modeling inter-layer connections as low-rank matrices, which assigns a spatially constrained emphasis on up- or downdated edges. These could represent, e.g., breakages of water/gas pipes or obstructions in street networks in real-time infrastructure monitoring applications. We analyze the structure of the of the block matrix inverse with respect to entry decay in the blocks above the block-diagonal. This gives rise to two truncation approaches that allow drastic computational runtime reductions at the cost of introducing a controlled truncation error. Numerical experiments on a range of real-world spatio-temporal networks of size up to 2· 10^8 illustrate accuracy and efficiency with runtime gains of up to a factor of $679$.
ER -