Dynamic Graph Neural Networks are graph learning models designed for graphs whose structure, node features, or edge interactions change over time, making them the natural extension of Graph Neural Networks (GNNs) from static relational data to temporal systems such as financial transactions, social interactions, communication networks, traffic systems, knowledge graphs, and biological processes. They matter because most real-world graphs are not frozen snapshots; they evolve continuously, and useful prediction requires modeling both relational structure and temporal dynamics.

Why Static GNNs Are Not Enough

A standard GNN assumes a fixed graph and propagates messages over static edges. That works for citation graphs or molecular graphs, but breaks down when:

• Users form and break social connections
• Fraud rings emerge and dissolve in payment networks
• Road traffic intensity changes minute by minute
• Communication edges appear as streaming events
• Knowledge graph facts have timestamps and temporal validity

If time is ignored, the model loses causality, recency, and event order, which are often the most predictive parts of the signal.

Two Main Problem Settings

Snapshot-based models treat time as a sequence of static graphs. This is simpler and works when data naturally arrives in batches. Event-based models process each interaction as it happens, which is more faithful for highly dynamic systems.

Core Architectural Approaches

1. Recurrent Dynamic GNNs

• Use GRUs or LSTMs to update node embeddings or GNN weights over time
• Example: EvolveGCN evolves the GCN parameters themselves rather than just node states
• Good for snapshot sequences where each time step is dense

2. Temporal Attention Models

• Use attention over historical neighbors or prior events
• Example: TGAT (Temporal Graph Attention Network) encodes continuous time with functional time encodings and attention over temporal neighborhoods
• Better at modeling irregular event timing than simple RNNs

3. Memory-Based Event Models

• Maintain a memory state for each node updated after interactions
• Example: TGN (Temporal Graph Networks) combines node memory, message functions, temporal embedding, and neighborhood aggregation
• Powerful for streaming settings such as transaction fraud or recommendation

4. Temporal Random Walk Models

• Sample time-respecting walks through the graph history
• Example: CAWN uses anonymous temporal walks to model dynamic structure
• Effective for temporal link prediction tasks

Common Tasks for Dynamic GNNs

• Temporal link prediction: Will user A transact with user B next week?
• Node classification over time: Is this account becoming fraudulent? Is this user likely to churn?
• Event prediction: What interaction type will occur next?
• Anomaly detection: Detect unusual sequences of graph events in cybersecurity or finance
• Traffic forecasting: Predict edge weights or node congestion levels over time

Industrial Applications

Financial fraud detection:

• Accounts, merchants, devices, and IPs form a dynamic transaction graph
• Fraud patterns are temporal; recency and burst behavior matter more than static similarity
• Dynamic GNNs outperform tabular baselines when relational fraud rings are important

Recommendation systems:

• User-item interactions are inherently temporal
• Dynamic graph models capture evolving user taste better than static collaborative filtering

Telecom and infrastructure:

• Communication graphs change continuously
• Dynamic GNNs help with fault localization, intrusion detection, and traffic engineering

Drug discovery and biology:

• Protein interaction and signaling networks change with time and experimental conditions

Main Challenges

• Scalability: Event streams can contain billions of edges; memory and neighbor sampling become hard
• Temporal leakage: Evaluation must avoid accidentally training on future information
• Irregular timestamps: Events are not evenly spaced, making naive discretization lossy
• Concept drift: The meaning of patterns can change over time, especially in finance and social systems
• Benchmark fragmentation: Datasets and evaluation protocols vary widely, making fair comparison difficult

Important Benchmarks and Models

• JODIE: Early dynamic embedding model for temporal interactions
• TGN: Strong general framework for dynamic graph representation learning
• TGAT: Temporal attention with continuous-time encoding
• DyRep: Models communication and topological evolution jointly
• Wikipedia / Reddit temporal graphs: Standard event-based benchmarks
• MOOC / LastFM / UCI: Common datasets for link prediction and temporal recommendation

Dynamic GNNs are best understood as bringing time into the relational inductive bias of graph learning. For any production problem where relationships evolve, they offer a more faithful and often more accurate modeling approach than static GNNs or flat tabular features alone.