Skip to content
Review

Centrality Measures in Temporal Networks: A Critical and Comparative Survey

Aug 2026 · 0 citations · 90 references
Computer Science

TL;DR

A critical and comparative survey of centrality measures in temporal networks is presented, and a functional taxonomy that categorizes existing approaches according to the primary mechanism through which influence is quantified in temporal networks is proposed.

Abstract

Temporal networks offer a suitable representation for complex systems in which interactions vary over time, such as communication, transportation, and social networks. Identifying influential nodes in such networks is more challenging than in static graphs because node importance depends not only on network structure but also on the timing and ordering of interactions. Although many temporal centrality measures have been proposed, the literature remains fragmented, with limited consensus on their comparative performance and applicability. This paper presents a critical and comparative survey of centrality measures in temporal networks. We review both temporal extensions of classical centrality metrics and measures specifically designed for temporal graphs, and propose a functional taxonomy that categorizes existing approaches according to the primary mechanism through which influence is quantified in temporal networks. The proposed taxonomy organizes temporal centrality measures into interaction-based, path-based, walk-based, spectral-based and robustness-based categories, providing a unified perspective on their underlying principles. In addition, we provide comparative insights to help select appropriate temporal centrality measures under different network characteristics and application settings. To complement the survey, we conduct experiments on multiple real-world temporal network datasets. The measures are evaluated through influence spreading experiments using epidemic diffusion models, ranking consistency analysis based on Kendall's rank correlation, and runtime complexity analysis to assess computational efficiency and scalability. Finally, we highlight key open challenges and future research directions, including scalability for million-sized networks and the need for standardized evaluation frameworks.

View source

Similar papers

Preprint Aug 2026

Spectral Efficiency Centrality: An Efficient Spectral Approach for Influential Node Identification in Temporal Networks

Spectral Efficiency Centrality (SEC), a temporal spectral centrality framework that quantifies node importance by evaluating the change in spectral radius caused by node removal across temporal snapshots, and ASEC, an efficient approximation based on Perron-Frobenius theory and first-order eigenvalue perturbation that...

Aksa Urooj, Iqra Altaf Gillani · 0 citations
Review Open access Sep 2026

A Comprehensive Survey on Identifying Influential Nodes: From Structural Centrality-based to Learning-based Methods

Identifying influential nodes in complex networks is a fundamental challenge in network science. This problem involves measuring the influence of nodes and identifying those that exert the greatest impact on network dynamics and information dissemination. Existing approaches can be broadly divided into two categories:...

Amir Sheikhahmadi, L. Tafakori, M. Jalili · 0 citations
Preprint Sep 2026

Edge-based Katz centralities for spatio-temporal multiplex networks

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 drastica...

Kai Bergermann, Francesco Gravili, V. Simoncini et al. · 0 citations
Preprint Aug 2026

Comparing Probabilistic Influence-Spreading Centralities to Commonly-Used Centrality Measures in Directed and Weighted Networks

Comparing the ISM centrality measures to commonly used weighted variants of out-degree, in-degree, closeness, shortest-path betweenness, and Katz centrality in directed, weighted networks shows strong correlations between the ISM out-centrality and weighted out-degree and outward Katz centrality, particularly for low e...

J. Luhtala, Vesa Kuikka, K. Kaski · 0 citations
Open access Sep 2026

MoTIvE: a motif-based framework for node ranking in temporal networks

Identifying influential spreaders in temporal networks is essential for understanding and controlling information and disease propagation. Among existing centrality methods, local methods have gained considerable attention due to their computational efficiency and their ability to identify influential spreaders usi...

Srestha Sadhu, Amrita Namtirtha, Ramya D. Shetty et al. · 0 citations
Sep 2026

Dynamics of Local Clustering in Temporal Social Networks

While the local clustering coefficient is central to network analysis, it is typically treated as a static property. We introduce delta clustering to quantify changes in an individual's local clustering across adjacent time points in undirected networks. To address structural constraints, we develop a density-based dec...

Cheng Wang, Omar Lizardo, David S. Hachen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.