Methods › Graphs › Graph Models › TGN
Temporal Graph Network
TGN
Introduced by Emanuele Rossi et al. in Temporal Graph Networks for Deep Learning on Dynamic Graphs
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Temporal Graph Network, or TGN, is a framework for deep learning on dynamic graphs represented as sequences of timed events. The memory (state) of the model at time t consists of a vector sᵢ(t) for each node i the model has seen so far. The memory of a node is updated after an event (e.g. interaction with another node or node-wise change), and its purpose is to represent the node's history in a compressed format. Thanks to this specific module, TGNs have the capability to memorize long term dependencies for each node in the graph. When a new node is encountered, its memory is initialized as the zero vector, and it is then updated for each event involving the node, even after the model has finished training.
In Syntology code not checked for this name. The lookup matched a different name in Syntology's graph, 'Temporal Graph Networks (TGN)' (resolution: alias), and its answer is about that name only, so it does not say whether this method has code. About another paper: this answer is about arXiv:2510.21994, while the archive credits arXiv:2006.10637.
Origin paper of this answer, arXiv:2510.21994 (its page on Syntology).
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 16 · with a code link: 9 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 16 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 16 of 16, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
A Batch-Insensitive Dynamic GNN Approach to Address Temporal Discontinuity in Graph Streams 24 Jun 2025 · 0 repositories · arXiv:2506.19282
-
Trajectory Encoding Temporal Graph Networks 15 Apr 2025 · 1 repository · arXiv:2504.11386
-
Enhancing the Expressivity of Temporal Graph Networks through Source-Target Identification 6 Nov 2024 · 1 repository · arXiv:2411.03596Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 2 harvested samples) · 2 pointer-only (licence)
-
Retrofitting Temporal Graph Neural Networks with Transformer 9 Sep 2024 · 1 repository · arXiv:2409.05477
-
UTG: Towards a Unified View of Snapshot and Event Based Models for Temporal Graphs 17 Jul 2024 · 0 repositories · arXiv:2407.12269
-
Temporal Graph Rewiring with Expander Graphs 4 Jun 2024 · 1 repository · arXiv:2406.02362
-
Temporal Graph Networks for Graph Anomaly Detection in Financial Networks 27 Mar 2024 · 0 repositories · arXiv:2404.00060
-
A Temporal Graph Network Framework for Dynamic Recommendation 24 Mar 2024 · 1 repository · arXiv:2403.16066
-
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers 30 Nov 2023 · 0 repositories · arXiv:2311.18526
-
Towards Temporal Edge Regression: A Case Study on Agriculture Trade Between Nations 15 Aug 2023 · 1 repository · arXiv:2308.07883
-
Analysis of different temporal graph neural network configurations on dynamic graphs 2 May 2023 · 0 repositories · arXiv:2305.01128
-
DyG2Vec: Efficient Representation Learning for Dynamic Graphs 30 Oct 2022 · 2 repositories · arXiv:2210.16906
-
Rethinking The Memory Staleness Problem In Dynamics GNN 6 Sep 2022 · 1 repository · arXiv:2209.02462
-
Adaptive Data Augmentation on Temporal Graphs 1 Dec 2021 · 0 repositories
-
Multi Scale Temporal Graph Networks For Skeleton-based Action Recognition 5 Dec 2020 · 0 repositories · arXiv:2012.02970
-
Temporal Graph Networks for Deep Learning on Dynamic Graphs 18 Jun 2020 · 10 repositories · arXiv:2006.10637Syntology 11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified (of 19 harvested samples)
Tasks archive 2025-07-28
20 shown of 27 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections