Higher-Order Aggregate Networks in the Analysis of Temporal Networks: Path structures and centralities
Not on the map. Why?
Abstract (arXiv)
Recent research on temporal networks has highlighted the limitations of a static network perspective for our understanding of complex systems with dynamic topologies. In particular, recent works have shown that i) the specific order in which links occur in real-world temporal networks affects causality structures and thus the evolution of dynamical processes, and ii) higher-order aggregate representations of temporal networks can be used to analytically study the effect of these order correlations on dynamical processes. In this article we analyze the effect of order correlations on path-based centrality measures in real-world temporal networks. Analyzing temporal equivalents of betweenness, closeness and reach centrality in six empirical temporal networks, we first show that an analysis of the commonly used static, time-aggregated representation can give misleading results about the actual importance of nodes. We further study higher-order time-aggregated networks, a recently proposed generalization of the commonly applied static, time-aggregated representation of temporal networks. Here, we particularly define path-based centrality measures based on second-order aggregate networks, empirically validating that node centralities calculated in this way better capture the true temporal centralities of nodes than node centralities calculated based on the commonly used static (first-order) representation. Apart from providing a simple and practical method for the approximation of path-based centralities in temporal networks, our results highlight interesting perspectives for the use of higher-order aggregate networks in the analysis of time-stamped network data.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Aug 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 1; 2025: 1.
6 papers.
- 2022De Bruijn goes Neural: Causality-Aware Graph Neural Networks for Time Series Data on Dynamic Graphscited by 10
- 2023Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphscited by 5
- 2024Longitudinal Modularity, a Modularity for Link Streamscited by 2
- 2025Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphscited by 2
- 2021Predicting Influential Higher-Order Patterns in Temporal Network Datacited by 1
- 2023Disentangling Node Attributes from Graph Topology for Improved Generalizability in Link Predictioncited by 0
- 2025Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs30 May 2025
- 2024Longitudinal Modularity, a Modularity for Link Streams29 Aug 2024
- 2023Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs24 Oct 2023
- 2023Disentangling Node Attributes from Graph Topology for Improved Generalizability in Link Prediction17 Jul 2023
- 2022De Bruijn goes Neural: Causality-Aware Graph Neural Networks for Time Series Data on Dynamic Graphs17 Sep 2022
- 2021Predicting Influential Higher-Order Patterns in Temporal Network Data26 Jul 2021