- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes DG-FDE, a continuous-time dynamic graph model in which node embeddings follow a Caputo fractional ODE with piecewise-constant adjacency matrices along the observation path.
Critical strengths
-
Incorporating piecewise-constant graph paths as a measurable forcing term in a Volterra equation with well-posedness result.
-
The decomposition approach is interpreable with explicit weights depending on snapshot duration and lag.
Critical weaknesses
- Well-posedness analysis for Caputo fractional graph dynamics with evolving topologies is a consequence of well-known results on Volterra equations and not cannot be considered to be novel.
Questions for authors
-
Why is there a significant difference in the numerical results for GNODE and DG-FDE with ? What is the difference in implementation? Please run GNODE with the same fixed-step solver, step size and vector field.
-
SDE based models are not considered as baselines. Why?
-
Please add FROND, NvoFDE or FADE (static fractional graph models) and at least one strong CTDG baseline (DyGFormer/TGN family), and consider event-based benchmarks.
-
How are observation times scaled, and how sensitive are results to rescaling of time?
-
The datasets used for node property prediction are quite small. The test set has around 3 windows only. Larger datasets should be used to verify the performance and statistical significance.
-
Please provide statistical significance tests for your results.
3 comments
Response to Reviewer rCr5 (2/2)
Q3. Please add FROND, NvoFDE or FADE (static fractional graph models) and at least one strong CTDG baseline (DyGFormer/TGN family), and consider event-based benchmarks.
A4. Thank you for suggesting these baselines. Our original experiments focused on snapshot-based methods because DG-FDE takes a sequence of graph snapshots as input. These comparisons included Hawkes-GCN and Hawkes-GAT, two strong baselines for next-snapshot link prediction (Section 5.3, pp. 9–10). Hawkes-GNN
Following your suggestion, we added DyGFormer, TGN, TGAT, and CTAN to the long-range link prediction task from T-GRAB [1]. We chose this task because it tests whether models can use information from several snapshots ago and several hops away to predict current links. CTDG models such as DyGFormer are good at capturing long-range temporal dependencies. We compared DG-FDE with both CTDG and DTDG baselines on T-GRAB [1], a recent synthetic benchmark that tests whether models can use information from far back in time and many hops away in the graph. We added this comparison to Section 5.1 (pp. 8–9). Figure 3 (p. 9) shows the results, and Table 5 (p. 22) reports the full scores.
The static-graph versions of FROND, NvoFDE, and FADE that you suggested work with a fixed graph topology. They are used for tasks such as node and graph classification, where oversmoothing is a common concern. Using them for our dynamic link prediction task would require us to make a design choice. We could use their continuous depth to represent time, or we could merge the past snapshots into a single graph, as we do for GCN, GAT, and GraphSAGE in Appendix E.2 (pp. 26–27). These two choices would test different things, making a direct comparison with DG-FDE hard to interpret. We discuss this line of work in the Introduction and Related Work.
Reference
- [1] Dizaji, A., et al. (2026). T-GRAB: A Synthetic Diagnostic Benchmark for Learning on Temporal Graphs. KDD, 2628–2639. Paper
Q4. How are observation times scaled, and how sensitive are results to rescaling of time?
A5. Thank you for pointing out this important issue. In our temporal link prediction experiments, each dataset uses its own interval to build graph snapshots. These intervals range from one hour for Contact to 30 days for Enron. Inside the model, one snapshot interval is one time unit. We assign the snapshots in each input window the times , and the solver uses this grid directly. Changing the units of the raw timestamps has no effect on DG-FDE as long as the snapshots stay the same. DG-FDE performed well across datasets with these different snapshot intervals (Section 5.3, Table 2, p. 10). If we convert the raw timestamps from seconds to minutes and convert the snapshot intervals accordingly, we get the same snapshots. The solver receives the same inputs and gives the same result.
Q5. The datasets used for node property prediction are quite small. The test set has around 3 windows only. Larger datasets should be used to verify the performance and statistical significance.
Q6. Please provide statistical significance tests for your results.
A6. Thank you for raising these points. For node property prediction, we used England-Covid and Twitter-Tennis because they were the only datasets we found in the PyTorch Geometric Temporal benchmark where both node features and graph structure change over time (Appendix D.2, pp. 22–23). To test DG-FDE on longer sequences, we added the synthetic T-GRAB experiment, with 4,001 to 4,032 snapshots per setting (Section 5.1 and Table 4, p. 21). Our real-world link prediction experiments also include larger graphs, such as Reddit Title with over 54,000 nodes and AS733 with over one million temporal edges. Some controlled differential equation baselines, including STG-NCDE and PENG-CDE, ran out of GPU memory on some of these datasets (Tables 2 and 7, pp. 10 and 24). We plan to test on larger node property prediction datasets and make the solver more efficient so we can evaluate how well DG-FDE generalizes at that scale.
We also added a permutation-based Friedman test for temporal link prediction. Across seven datasets and 18 methods with results on all seven, the test found an overall difference among methods (). DG-FDE with fixed and learned fractional orders had the two best average ranks, at 1.71 and 2.00, respectively. For node property prediction, we report average ranks across the two datasets. We revised the paper and added the statistical analysis to Appendix G (pp. 30–31, Figures 8 and 9).
I thank the authors for the detailed clarification and rebuttal. I have no further questions.
Response to Reviewer rCr5 (1/2)
Thank you for reading our paper carefully and sharing your feedback. Your comments helped us improve the manuscript. We respond to each point below and explain what we changed. We’re happy to clarify anything that remains unclear.
A1. Thank you for pointing this out. We agree that the proof uses standard Volterra theory [1]. To our knowledge, prior work on dynamic graph representation learning has yet to study the well-posedness of differential equations driven by piecewise-constant graph snapshots.
The autoregressive Graph Neural ODE in [2] updates node states at observation times, which can cause jumps in the states. GN-CDE can use cubic splines to connect graph snapshots, which adds preprocessing cost [3]. In DG-FDE, we simply use the observed graph on each interval until the next snapshot arrives.
To our knowledge, prior work on dynamic graph representation learning has not analyzed well-posedness for this specific Caputo model with piecewise-constant graph inputs. Section 4.2 (p. 5) gives sufficient conditions that allow the vector field to jump when the graph changes. Theorem 1 shows that under these conditions, the model still has a unique continuous mild solution over the entire time window.
References
A2. The two rows in Table 2 use different setups. GNODE uses the adaptive
dopri5solver, while DG-FDE uses fixed-step ABM. The graph vector fields also differ. Both differences can affect the final embeddings and link prediction scores.We set α=1 in DG-FDE and used the same solver, vector field, and experimental setup as GNODE. As shown in Table R1, the two models gave identical results.
Table R1. GNODE and DG-FDE at α=1 on Enron, Contact, and RDS.
dopri5)A3. SDE-based baseline. Thank you for pointing this out. We overlooked SDE-based models in our original comparison. Following your suggestion, we added LNJSDE [1], a recent neural jump SDE model, to our real-world experiments on dynamic node property prediction and temporal link prediction.
As shown in Table R2, our fractional differential equation model, DG-FDE, outperformed the SDE-based LNJSDE on all nine datasets in this comparison. We revised the paper and added the results to Sections 5.2 and 5.3 (pp. 8–10, Tables 1 and 2).
Table R2. LNJSDE vs. DG-FDE on real-world datasets.
Reference