Eigenvector-Based Centrality Measures for Temporal Networks
Not on the map. Why?
Abstract (arXiv)
Numerous centrality measures have been developed to quantify the importances of nodes in time-independent networks, and many of them can be expressed as the leading eigenvector of some matrix. With the increasing availability of network data that changes in time, it is important to extend such eigenvector-based centrality measures to time-dependent networks. In this paper, we introduce a principled generalization of network centrality measures that is valid for any eigenvector-based centrality. We consider a temporal network with N nodes as a sequence of T layers that describe the network during different time windows, and we couple centrality matrices for the layers into a supra-centrality matrix of size NTxNT whose dominant eigenvector gives the centrality of each node i at each time t. We refer to this eigenvector and its components as a joint centrality, as it reflects the importances of both the node i and the time layer t. We also introduce the concepts of marginal and conditional centralities, which facilitate the study of centrality trajectories over time. We find that the strength of coupling between layers is important for determining multiscale properties of centrality, such as localization phenomena and the time scale of centrality changes. In the strong-coupling regime, we derive expressions for time-averaged centralities, which are given by the zeroth-order terms of a singular perturbation expansion. We also study first-order terms to obtain first-order-mover scores, which concisely describe the magnitude of nodes' centrality changes over time. As examples, we apply our method to three empirical temporal networks: the United States Ph.D. exchange in mathematics, costarring relationships among top-billed actors during the Golden Age of Hollywood, and citations of decisions from the United States Supreme Court.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Jul 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2021Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networkscited by 2
- 2023A Network Science perspective of Graph Convolutional Networks: A surveycited by 1
- 2025Critical Nodes Identification in Complex Networks: A Surveycited by 1
- 2021Missing Data Estimation in Temporal Multilayer Position-aware Graph Neural Network (TMP-GNN)cited by 0
- 2025Critical Nodes Identification in Complex Networks: A Survey8 Jul 2025
- 2023A Network Science perspective of Graph Convolutional Networks: A survey12 Jan 2023
- 2021Missing Data Estimation in Temporal Multilayer Position-aware Graph Neural Network (TMP-GNN)7 Aug 2021
- 2021Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks19 Jun 2021