Future link prediction on temporal graphs involves both repeated interactions between previously connected node pairs and first-time interactions between pairs with no prior interaction. While repeate...
arXiv:2610.19364v1 Announce Type: new
Abstract: Dynamic graph learning models how entities and their relations evolve from historical observations to predict future graph states. Existing methods do...
By Bo Li, Yue Yang, Yujin Huang, Siao Liu, David Lemphers, Sara E Rodriguez Gomez, Luke Borgnolo, Can Wang, Xin Zheng
The paper investigates whether temporal link predictors can forgo learned node representations in favor of simple statistical counts of interaction patterns. It introduces a predictor that aggregates transition and co‑occurrence counts, smooths them with destination frequencies or Kneser‑Ney continuation counts, and combines these with popularity, source history, and recency via a shared log‑linear rule. With only 9–13 learned parameters, the model achieves the best mean reciprocal rank on 7 of 16 datasets and outperforms several baselines across all evaluated datasets, demonstrating that a lightweight, count‑based approach can rival more complex neural methods.
arXiv:2607. 07716v1 Announce Type: cross Abstract: Temporal graphs are ubiquitous in real-world applications and Temporal Graph Networks (TGNs) have achieved superior predictive accuracy.
By Yazheng Liu, Xi Zhang, Sihong Xie, Hui Xiong
arXiv:2610.27558v1 Announce Type: cross
Abstract: Memory-based temporal graph neural networks (TGN) rely on recurrent node memories to capture evolving interaction histories. However, temporal mini-b...
By Haroon Gharwi, Kai Shu, Yue Dai
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