Gaussian Embedding of Temporal Networks
Not on the map. Why?
Abstract (arXiv)
Representing the nodes of continuous-time temporal graphs in a low-dimensional latent space has wide-ranging applications, from prediction to visualization. Yet, analyzing continuous-time relational data with timestamped interactions introduces unique challenges due to its sparsity. Merely embedding nodes as trajectories in the latent space overlooks this sparsity, emphasizing the need to quantify uncertainty around the latent positions. In this paper, we propose TGNE (Temporal Gaussian Network Embedding), an innovative method that bridges two distinct strands of literature: the statistical analysis of networks via Latent Space Models (LSM)citeHoff2002 and temporal graph machine learning. TGNE embeds nodes as piece-wise linear trajectories of Gaussian distributions in the latent space, capturing both structural information and uncertainty around the trajectories. We evaluate TGNE's effectiveness in reconstructing the original graph and modelling uncertainty. The results demonstrate that TGNE generates competitive time-varying embedding locations compared to common baselines for reconstructing unobserved edge interactions based on observed edges. Furthermore, the uncertainty estimates align with the time-varying degree distribution in the network, providing valuable insights into the temporal dynamics of the graph. To facilitate reproducibility, we provide an open-source implementation of TGNE at urlhttps://github.com/aida-ugent/tgne.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 19 of its 31 references that are in the map. First posted on arXiv 27 May 2024.
Builds on
19 of 31 references.
References · 19
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
- 2023Temporal Graph Benchmark for Machine Learning on Temporal Graphscited by 137
- 2022Towards Better Evaluation for Dynamic Link Predictioncited by 120
- 2019Diachronic Embedding for Temporal Knowledge Graph Completioncited by 104
- 2017A Review of Dynamic Network Models with Latent Variablescited by 18
- 2014Contact patterns among high school studentscited by 17
7 more
- 2014Data on face-to-face contacts in an office building suggests a low-cost vaccination strategy based on community linkerscited by 17
- 2018Conditional Network Embeddingscited by 15
- 2022A Mutually Exciting Latent Space Hawkes Process Model for Continuous-time Networkscited by 10
- 2021Mutually exciting point process graphs for modelling dynamic networkscited by 8
- 2021Continuous Latent Position Models for Instantaneous Interactionscited by 8
- 2021DynG2G: An Efficient Stochastic Graph Embedding Method for Temporal Graphscited by 8
- 2023Latent Position Network Modelscited by 1
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025Multiresolution Analysis and Statistical Thresholding on Dynamic Networkscited by 1
- 2025Spectral clustering for dependent community Hawkes process models of temporal networkscited by 0
- 2026Dynamic Latent Space Modeling of Inhomogeneous Poisson Network Processes with Applications to International Relationscited by 0
- 2026Dynamic Latent Space Modeling of Inhomogeneous Poisson Network Processes with Applications to International Relations8 Sep 2026
- 2025Multiresolution Analysis and Statistical Thresholding on Dynamic Networks1 Jun 2025
- 2025Spectral clustering for dependent community Hawkes process models of temporal networks28 May 2025