MambaTG: Candidate-Aware State Space Modeling for Future Link Prediction on Temporal Graphs
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
MambaTG is a new framework for future link prediction on temporal graphs that addresses both repeated and unseen edge prediction. It leverages two complementary signals: the historical-sequence evolution of a node’s interactions and the compatibility between a candidate edge and the node’s evolving history. By using a candidate-aware Mamba architecture, the model captures ordered interaction dynamics and adapts state transitions to different candidates, achieving strong performance across 13 datasets while remaining computationally efficient.
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...
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.
arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.
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...