arXiv Machine Learning
Jun 2
Modeling Spectral Energy Shifts in Spatio-Temporal Graph Anomaly Detection
arXiv:2606. 00304v1 Announce Type: new Abstract: Graph anomaly detection methods aim to distinguish anomalous nodes.
Differentiable Koopman Operator for Contrastive Learning on Dynamic Graphs
The paper introduces KAIROS, a self‑supervised framework that embeds a differentiable Koopman operator into a dynamic graph contrastive learning loop. By linearizing temporal evolution in the embedding space, KAIROS jointly optimizes raw node features and a graph‑diffused structural view using multi‑granularity contrastive objectives across time windows. For anomaly detection, it combines Koopman prediction residuals with temporal inconsistency and local neighborhood deviation, achieving state‑of‑the‑art results on nine dynamic graph benchmarks and competitive performance on unsupervised node classification.
Related stories
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.
arXiv Machine Learning
Jun 8
Learnable Kernel Density Estimation for Graphs and Its Application to Graph-Level Anomaly Detection
arXiv:2505. 21285v5 Announce Type: replace Abstract: This work proposes a framework LGKDE that learns kernel density estimation for graphs.
arXiv Machine Learning
Oct 3
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.
arXiv AI
Sep 25
Beyond Static Graph World Models: Learning Stochastic Latent Dynamics over Evolving Topologies
The paper introduces the Graph Dynamics Model (GDM), a world model that learns stochastic latent dynamics over evolving graph topologies. GDM employs a sparse recurrent adjacency matrix for topology updates and a recurrent state‑space architecture for stochastic transitions, enabling it to handle partially observable, stochastic environments. The authors also propose the Graph Distribution Distance (GDD) metric, using maximum mean discrepancy with a graph kernel, to compare predicted and true joint graph state distributions, and demonstrate GDM’s superior performance and zero‑shot generalisation on large graphs.
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.
arXiv Machine Learning
Jul 22
Scalable and Efficient Joint Spiking Embedding Predictive Architecture for Large-Scale Dynamic Graphs
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.
arXiv AI
Jun 24
Invariant Graph Representations for Continuous-Time Dynamic Graphs Under Distribution Shifts
arXiv:2405. 19062v2 Announce Type: replace-cross Abstract: Continuous-Time Dynamic Graphs (CTDGs) enable fine-grained modeling of evolving relational systems.
arXiv Machine Learning
Oct 15
Dynamic Graph World Modelling: Learning Future Dynamics from Temporal Context
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...
arXiv AI
Jun 2
Learning Discriminative and Generalizable Anomaly Detector for Dynamic Graph with Limited Supervision
arXiv:2602. 20019v2 Announce Type: replace-cross Abstract: Dynamic graph anomaly detection is critical for many real-world applications but remains challenging due to the scarcity of labeled anomalies.
arXiv Machine Learning
Jun 3
TIDFormer: Exploiting Temporal and Interactive Dynamics Makes A Great Dynamic Graph Transformer
arXiv:2506. 00431v2 Announce Type: replace Abstract: Due to the proficiency of self-attention mechanisms (SAMs) in capturing dependencies in sequence modeling, several existing dynamic graph neural networks (DGNNs) utilize Transformer architectures with various encoding designs to capture sequential evolutions of dynamic graphs.
arXiv AI
Sep 7
Dynamic Heterogeneous Graph Representation Learning: A Survey
The article surveys Dynamic Heterogeneous Graph Representation Learning (DHGRL), a field that tackles the challenges of modeling evolving, multi‑type networks. It introduces a unified definition covering both discrete‑time and continuous‑time DHGs, and proposes an algorithm‑centric taxonomy that groups methods into embedding‑based, GNN‑based, and Transformer‑based approaches, highlighting their biases toward temporal granularity. The survey also reviews key applications, datasets, benchmarks, and outlines future research directions.