Browse State-of-the-Art › Dynamic Link Prediction
Dynamic Link Prediction
20 papers with code · 10 benchmarks · 8 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
10 leaderboard tables shown for this task, 10 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
Syntology 4 newer papers were judged to report on this task's benchmarks so far (Claude Sonnet 4.5, reading their tables: a model's judgement, not a result; 0 placed): Enron (2 judged, 0 placed), LastFM (4 judged, 0 placed), MOOC (2 judged, 0 placed), Reddit (3 judged, 0 placed), UCI (2 judged, 0 placed), Wikipedia (2 judged, 0 placed). Drawn from 8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read).
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “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. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is 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 dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
8 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 41 · with a code link: 20 · where Syntology ran a sample: 9 (7 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (9 of 41 tagged: 7 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 41 of 41, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “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 figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. 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); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
26 Feb 2019 10 repositories listed Syntology official (archive's flag): 1 ran · 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified (of 11 harvested samples) · 1 pointer-only (licence)Existing approaches typically resort to node embeddings and use a recurrent neural network (RNN, broadly speaking) to regulate the embeddings and learn the temporal dynamics.
-
19 Jun 2018 3 repositories listed Syntology official (archive's flag): 1 ran · 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 2 harvested samples) · 2 pointer-only (licence)The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem.
-
23 Mar 2023 2 repositories listed Syntology community repositories only · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples)We propose DyGFormer, a new Transformer-based architecture for dynamic graph learning.
-
30 Oct 2022 2 repositories listedTemporal graph neural networks have shown promising results in learning inductive representations by automatically extracting temporal patterns.
-
26 Aug 2019 2 repositories listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)Representation learning over graph structured data has been mostly studied in static graph settings while efforts for modeling dynamic graphs are still scant.
-
1 May 2019 2 repositories listedWe present DyRep - a novel modeling framework for dynamic graphs that posits representation learning as a latent mediation process bridging two observed processes namely -- dynamics of the network (realized as…
-
26 Sep 2024 1 repository listed Syntology official (archive's flag): 6 ran · 6 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; 5 where Syntology's instrument failed) · 0 unverified (of 6 harvested samples)Fully connected Graph Transformers (GT) have rapidly become prominent in the static graph community as an alternative to Message-Passing models, which suffer from a lack of expressivity, oversquashing, and…
-
22 Aug 2024 1 repository listedIn this study, we introduce a self-supervised method for learning representations of temporal networks and employ these representations in the dynamic link prediction task.
-
17 Jul 2024 1 repository listedDynamic link prediction is a critical task in the analysis of evolving networks, with applications ranging from recommender systems to economic exchanges.
-
27 May 2024 1 repository listedHowever, a single metric is not sufficient to fully capture the differences between DLP algorithms, and is prone to overly optimistic performance evaluation.
-
30 Nov 2023 1 repository listedWe leverage these visualization tools to investigate the effect of negative sampling on the predictive performance, at the node and edge level.
-
21 Nov 2023 1 repository listed Syntology official (archive's flag): 1 ran · 4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples) · 3 pointer-only (licence)Dynamic Graph Neural Networks (DGNNs) have emerged as the predominant approach for processing dynamic graph-structured data.
-
22 Mar 2023 1 repository listed Syntology official (archive's flag): 7 ran · 7 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; 0 where Syntology's instrument failed) · 1 unverified (of 8 harvested samples)Dynamic graphs arise in various real-world applications, and it is often welcomed to model the dynamics directly in continuous time domain for its flexibility.
-
23 Oct 2022 1 repository listedTemporal networks are an important type of network whose topological structure changes over time.
-
20 Jul 2022 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)To evaluate against more difficult negative edges, we introduce two more challenging negative sampling strategies that improve robustness and better match real-world applications.
-
24 Apr 2022 1 repository listedIn this paper, we propose a formalized approach to this problem with a framework we call EULER.
-
30 Mar 2022 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 2 unverified (of 2 harvested samples) · 1 pointer-only (licence)User interests are usually dynamic in the real world, which poses both theoretical and practical challenges for learning accurate preferences from rich behavior data.
-
29 Sep 2021 1 repository listedWe compare link prediction heuristics, GNNs, discrete DGNNs, and continuous DGNNs on dynamic link prediction.
-
23 Sep 2019 1 repository listedWe consider a common case in which edges can be short term interactions (e. g., messaging) or long term structural connections (e. g., friendship).
-
7 Sep 2018 1 repository listedCapturing such evolution is key to predicting the properties of unseen networks.
-
Higher-order Structure Boosts Link Prediction on Temporal Graphs21 May 2025 0 repositories listedTemporal Graph Neural Networks (TGNNs) have gained growing attention for modeling and predicting structures in temporal graphs.
-
A PID-Controlled Tensor Wheel Decomposition Model for Dynamic Link Prediction20 May 2025 0 repositories listedLink prediction in dynamic networks remains a fundamental challenge in network science, requiring the inference of potential interactions and their evolving strengths through spatiotemporal pattern analysis.
-
Predict Confidently, Predict Right: Abstention in Dynamic Graph Learning14 Jan 2025 0 repositories listedMany real-world systems can be modeled as dynamic graphs, where nodes and edges evolve over time, requiring specialized models to capture their evolving dynamics in risk-sensitive applications effectively.
-
Dynamic Link and Flow Prediction in Bank Transfer Networks13 Sep 2024 0 repositories listedThe prediction of both the existence and weight of network links at future time points is essential as complex networks evolve over time.
-
13 Aug 2024 0 repositories listed Syntology 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 6 harvested samples) · 6 pointer-only (licence)Dynamic graph learning aims to uncover evolutionary laws in real-world systems, enabling accurate social recommendation (link prediction) or early detection of cancer cells (classification).
-
DyGMamba: Efficiently Modeling Long-Term Temporal Dependency on Continuous-Time Dynamic Graphs with State Space Models8 Aug 2024 0 repositories listedLearning useful representations for continuous-time dynamic graphs (CTDGs) is challenging, due to the concurrent need to span long node interaction histories and grasp nuanced temporal details.
-
Co-Neighbor Encoding Schema: A Light-cost Structure Encoding Method for Dynamic Link Prediction30 Jul 2024 0 repositories listedStructure encoding has proven to be the key feature to distinguishing links in a graph.
-
From Link Prediction to Forecasting: Information Loss in Batch-based Temporal Graph Learning7 Jun 2024 0 repositories listedDynamic link prediction is an important problem considered by many recent works proposing various approaches for learning temporal edge patterns.
-
Enhancing Cross-domain Link Prediction via Evolution Process Modeling3 Feb 2024 0 repositories listedThis work proposes DyExpert, a dynamic graph model for cross-domain link prediction.
-
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers30 Nov 2023 0 repositories listedMany graph representation learning (GRL) problems are dynamic, with millions of edges added or removed per second.
-
Dynamic Link Prediction for New Nodes in Temporal Graph Networks15 Oct 2023 0 repositories listed
-
Dynamic Graph Representation Learning via Edge Temporal States Modeling and Structure-reinforced Transformer20 Apr 2023 0 repositories listed
-
DBGDGM: Dynamic Brain Graph Deep Generative Model26 Jan 2023 0 repositories listed
-
Dyn-Backdoor: Backdoor Attack on Dynamic Link Prediction8 Oct 2021 0 repositories listed
-
Learning Representation over Dynamic Graph using Aggregation-Diffusion Mechanism3 Jun 2021 0 repositories listed
-
A Survey on Embedding Dynamic Graphs4 Jan 2021 0 repositories listed
-
GRADE: Graph Dynamic Embedding16 Jul 2020 0 repositories listed
-
Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey13 May 2020 0 repositories listed
-
Representation Learning over Dynamic Graphs11 Mar 2018 0 repositories listed
-
Semi-supervised Graph Embedding Approach to Dynamic Link Prediction14 Oct 2016 0 repositories listed
-
Evaluating Link Prediction Accuracy on Dynamic Networks with Added and Removed Edges25 Jul 2016 0 repositories listed
Syntology lines on 10 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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