Higher-order Structure Boosts Link Prediction on Temporal Graphs
Not on the map. Why?
Abstract (arXiv)
Temporal Graph Neural Networks (TGNNs) have gained growing attention for modeling and predicting structures in temporal graphs. However, existing TGNNs primarily focus on pairwise interactions while overlooking higher-order structures that are integral to link formation and evolution in real-world temporal graphs. Meanwhile, these models often suffer from efficiency bottlenecks, further limiting their expressive power. To tackle these challenges, we propose a Higher-order structure Temporal Graph Neural Network, which incorporates hypergraph representations into temporal graph learning. In particular, we develop an algorithm to identify the underlying higher-order structures, enhancing the model's ability to capture the group interactions. Furthermore, by aggregating multiple edge features into hyperedge representations, HTGN effectively reduces memory cost during training. We theoretically demonstrate the enhanced expressiveness of our approach and validate its effectiveness and efficiency through extensive experiments on various real-world temporal graphs. Experimental results show that HTGN achieves superior performance on dynamic link prediction while reducing memory costs by up to 50% compared to existing methods.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 37 references that are in the map. First posted on arXiv 21 May 2025.
Builds on
27 of 37 references.
References · 27
- 2017Attention Is All You Needcited by 60,361
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
- 2018Modeling polypharmacy side effects with graph convolutional networkscited by 237
- 2019Hypergraph Convolution and Hypergraph Attentioncited by 228
- 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 193
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 157
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 143
- 2022Towards Better Evaluation for Dynamic Link Predictioncited by 122
15 more
- 2016Higher-order organization of complex networkscited by 110
- 2018Simplicial Closure and higher-order link predictioncited by 93
- 2024Position: Graph Foundation Models are Already Herecited by 86
- 2021TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learningcited by 68
- 2023Neural Common Neighbor with Completion for Link Predictioncited by 64
- 2021The physics of higher-order interactions in complex systemscited by 63
- 2022Provably expressive temporal graph networkscited by 56
- 2022Neighborhood-aware Scalable Temporal Network Representation Learningcited by 54
- 2015Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithmcited by 50
- 2024A Survey on Temporal Knowledge Graph: Representation Learning and Applicationscited by 30
- 2020Hypergraph reconstruction from network datacited by 18
- 2024Efficient Neural Common Neighbor for Temporal Graph Link Predictioncited by 18
- 2024From Graphs to Hypergraphs: Hypergraph Projection and its Remediationcited by 6
- 2023Inference of dynamic hypergraph representations in temporal interaction datacited by 4
- 2023A Stochastic Block Hypergraph modelcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Homophily Enhanced Graph Domain Adaptationcited by 9
- 2025Homophily Enhanced Graph Domain Adaptation26 May 2025