arXiv Machine Learning

Explaining Temporal Graph Neural Networks via Feature-induced Information Flow

arXiv:2606. 27201v1 Announce Type: new Abstract: Event-based Temporal Graph Neural Networks (ETGNNs) have demonstrated strong performance across a wide range of applications, including social network analysis, epidemic tracing, recommender systems, and political event forecasting.

arXiv Machine Learning
Aug 27

DeltaGNN: Graph Neural Network with Information Flow Control

DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.

By Kevin Mancini, Islem Rekik
arXiv Machine Learning
Sep 4

Statistical Feature Augmentation for Anomaly Detection in Dynamic Graphs

The paper introduces a statistical feature augmentation technique that encodes behavioral interaction statistics into the input space for dynamic graph anomaly detection. Experiments on Reddit, Wikipedia, and MOOC datasets across seven models—both continuous-time and discrete-time—show that this augmentation consistently improves detection performance compared to models trained on original embeddings. The enriched input also facilitates fine-grained post-hoc analysis of behavioral importance, linking classical network analysis with deep learning.

By Philipp Schlinge, Jean-Luc Schnipper, Martin Atzmueller
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