arXiv Machine Learning By Nafiseh Sadat Sajadi, Behnam Bahrak, Mahdi Jafari Siavoshani

A Hybrid TGN-SEAL Model for Dynamic Graph Link Prediction

Read the original on arXiv Machine Learning →

arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 22

SiST-GNN: Simultaneous Spatial-Temporal Message Passing for Dynamic Graph Representation Learning

SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.

By Shubhajit Roy, Anirban Dasgupta
arXiv Machine Learning
1d ago

Information propagation dynamics in Deep Graph Networks

The paper explores how information propagates in Deep Graph Networks (DGNs) for both static and dynamic graphs, treating DGNs as dynamical systems. It presents new architectures that better preserve long‑term node dependencies and learn complex spatio‑temporal patterns from irregular, sparsely sampled dynamic graphs. The work combines theoretical analysis with empirical results to demonstrate the effectiveness of these designs.

By Alessio Gravina
arXiv AI
Sep 10

TTGBench: Benchmarking Topological Evolution and Semantic Drift in Text-attributed Temporal Graphs

TTGBench is a new benchmark for temporal graph learning that evaluates both structural evolution and semantic drift in text‑attributed graphs. It includes six real‑world, text‑rich datasets with dual volatility and supports multi‑class and multi‑label temporal node classification, addressing gaps left by existing benchmarks. A comprehensive evaluation of 17 state‑of‑the‑art methods shows a clear divide: TGNNs excel at structural prediction but struggle with semantic tracking, while LLM‑based models perform better on semantic tasks but lag in structural prediction.

By Longfei Ma, Zemin Liu, Fei Wu
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.

By Abigail J. Hayes, Tobias Schumacher, Markus Strohmaier