A Survey on Embedding Dynamic Graphs
Claudio D. T. Barros, Matheus R. F. Mendon\c{c}a, Alex B. Vieira,, Artur Ziviani

TL;DR
This survey comprehensively reviews methods for embedding dynamic graphs, addressing challenges like temporal modeling and behavior classification, and discusses applications such as link prediction and anomaly detection.
Contribution
It introduces a formal definition and taxonomy for dynamic graph embedding, covering recent advances and categorizing techniques by algorithmic approach.
Findings
Classifies dynamic behaviors into topological, feature, and process evolution.
Provides a taxonomy of embedding techniques including matrix factorization, deep learning, and temporal models.
Highlights key applications like link prediction, anomaly detection, and diffusion forecasting.
Abstract
Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks present dynamic behavior, including topological evolution, feature evolution, and diffusion. Therefore, several methods for embedding dynamic graphs have been proposed to learn network representations over time, facing novel challenges, such as time-domain modeling, temporal features to be captured, and the temporal granularity to be embedded. In this survey, we overview dynamic graph embedding, discussing its fundamentals and the recent advances developed so far. We introduce the formal definition of dynamic graph embedding, focusing on the problem setting and introducing a novel taxonomy for dynamic graph embedding input and output. We further explore…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsDiffusion
