Metraipolis › archive › dc_21205ece92eb

Edge-based Katz centralities for spatio-temporal multiplex networks — arXiv:2609.24638

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24638
License (as archived)
CC0-1.0
Archived
2026-10-09T07:00:20.088Z
SHA-256 of the archived text
a650ac980e6888906462fecf9d60a0ead70ff85c363fe5c9df0c488b1df4ee21
Stable URL of this page
https://metraipolis.com/documento/dc_21205ece92eb

How to cite

Edge-based Katz centralities for spatio-temporal multiplex networks — arXiv:2609.24638 — arXiv (en), https://arxiv.org/abs/2609.24638 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_21205ece92eb (Metraipolis archive dc_21205ece92eb, sha256 a650ac980e6888906462fecf9d60a0ead70ff85c363fe5c9df0c488b1df4ee21)
BibTeX
@misc{dc21205ece92eb,
  title = {Edge-based Katz centralities for spatio-temporal multiplex networks — arXiv:2609.24638},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24638},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_21205ece92eb; sha256 a650ac980e6888906462fecf9d60a0ead70ff85c363fe5c9df0c488b1df4ee21},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24638. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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\cdot 10^8$ illustrate accuracy and efficiency with runtime gains of up to a factor of $679$.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-22 in cs.SI).
Categorie arXiv: Numerical Analysis (math.NA) ; Social and Information Networks (cs.SI).
Pagina del lavoro: https://arxiv.org/abs/2609.24638 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T06:53:42.946Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).