arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.
By Nafiseh Sadat Sajadi, Behnam Bahrak, Mahdi Jafari Siavoshani
arXiv:2607. 05095v1 Announce Type: new Abstract: Temporal Graph Neural Networks (TGNNs) are widely used for learning from dynamic graphs in applications such as recommendation, social network analysis, and traffic forecasting.
By Yushu Cai, Qingrui Zhu, Lei Liu, Kai Sheng, Hao Chen, Xin He
CacheDyG introduces a cache‑refine framework that decouples temporal propagation from parameter updates in dynamic graph neural networks. By storing graph‑aware node‑time representations in non‑trainable buffers and updating only a lightweight refiner, residual gate, and link predictor during training, it reduces repeated recomputation of historical structures. Experiments on five benchmarks show that CacheDyG uses fewer trainable parameters, runs faster, and achieves competitive or better predictive performance compared to existing baselines.
By PinHeng Zong, Ye Yuan
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
arXiv:2607. 18412v1 Announce Type: new Abstract: Dynamic graph learning aims to capture evolving structural and semantic patterns in real-world systems, such as fraud detection and recommender systems.
By Huizhe Zhang, Yuchang Zhu, Huazhen Zhong, Liang Chen, Zibin Zheng
arXiv:2505. 12526v2 Announce Type: replace Abstract: Temporal graph networks suffer from irregular supervision in realworld dynamic graphs, as most minibatches contain few labeled events.
By Alexander Panyshev, Dmitry Vinichenko, Oleg Travkin, Roman Alferov, Alexey Zaytsev