arXiv Machine Learning
Dynamic Graph World Modelling: Learning Future Dynamics from Temporal Context
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jun 25
A Hybrid TGN-SEAL Model for Dynamic Graph Link Prediction
arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.
arXiv AI
Sep 25
Beyond Static Graph World Models: Learning Stochastic Latent Dynamics over Evolving Topologies
The paper introduces the Graph Dynamics Model (GDM), a world model that learns stochastic latent dynamics over evolving graph topologies. GDM employs a sparse recurrent adjacency matrix for topology updates and a recurrent state‑space architecture for stochastic transitions, enabling it to handle partially observable, stochastic environments. The authors also propose the Graph Distribution Distance (GDD) metric, using maximum mean discrepancy with a graph kernel, to compare predicted and true joint graph state distributions, and demonstrate GDM’s superior performance and zero‑shot generalisation on large graphs.
arXiv Machine Learning
Jul 17
What Do Temporal Graph Learning Models Learn?
arXiv:2510. 09416v4 Announce Type: replace Abstract: Learning on temporal graphs has become a central topic in graph representation learning, with numerous benchmarks indicating the strong performance of state-of-the-art models.
arXiv Computer Vision
Oct 1
World-as-Graph: Relational World Modeling Through Latent Space Graphs
arXiv:2609.38927v1 Announce Type: cross Abstract: World models aim to learn representations of real-world environments and predict their future evolution. Recent object-centric world models have made...
arXiv AI
Sep 7
Dynamic Heterogeneous Graph Representation Learning: A Survey
The article surveys Dynamic Heterogeneous Graph Representation Learning (DHGRL), a field that tackles the challenges of modeling evolving, multi‑type networks. It introduces a unified definition covering both discrete‑time and continuous‑time DHGs, and proposes an algorithm‑centric taxonomy that groups methods into embedding‑based, GNN‑based, and Transformer‑based approaches, highlighting their biases toward temporal granularity. The survey also reviews key applications, datasets, benchmarks, and outlines future research directions.
arXiv Machine Learning
Oct 15
Learning Across Temporal Graph Representation Silos
arXiv:2610.19576v1 Announce Type: new Abstract: Temporal graph data are recorded in different representations, but whether these differences also determine the scope of learned knowledge reuse remain...