Pith. sign in

REVIEW 2 cited by

A survey of dynamic graph neural networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.18211 v1 pith:5LUDIDIY submitted 2024-04-28 cs.LG cs.SI

classification cs.LGcs.SI
keywords dynamicgnnsmodelsnetworksgraphgraphsinformationlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph neural networks (GNNs) have emerged as a powerful tool for effectively mining and learning from graph-structured data, with applications spanning numerous domains. However, most research focuses on static graphs, neglecting the dynamic nature of real-world networks where topologies and attributes evolve over time. By integrating sequence modeling modules into traditional GNN architectures, dynamic GNNs aim to bridge this gap, capturing the inherent temporal dependencies of dynamic graphs for a more authentic depiction of complex networks. This paper provides a comprehensive review of the fundamental concepts, key techniques, and state-of-the-art dynamic GNN models. We present the mainstream dynamic GNN models in detail and categorize models based on how temporal information is incorporated. We also discuss large-scale dynamic GNNs and pre-training techniques. Although dynamic GNNs have shown superior performance, challenges remain in scalability, handling heterogeneous information, and lack of diverse graph datasets. The paper also discusses possible future directions, such as adaptive and memory-enhanced models, inductive learning, and theoretical analysis.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Future Link Prediction Without Memory or Aggregation

    cs.LG 2025-05 conditional novelty 6.0 of 10

    CRAFT replaces memory and aggregation with learnable node embeddings and destination-to-source-neighbor cross-attention, improving future link prediction on most of 17 temporal graph benchmarks.

  2. TIDFormer: Exploiting Temporal and Interactive Dynamics Makes A Great Dynamic Graph Transformer

    cs.LG 2025-05 conditional novelty 5.0 of 10

    TIDFormer, a dynamic graph Transformer with interaction-level self-attention and three encoding modules, achieves the best or second-best average rank on seven CTDG link prediction benchmarks.

Pith tools