.png){kind=icon}
Return
FuDGE: Modeling full dynamic graph evolution
.png){kind=icon}
PRE
AI
DOI：10.1007/s10844-026-01040-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Research in neural generative models for dynamic networks is constantly evolving, and sophisticated solutions have been exploited to characterize the long-term evolution of temporal graphs. Despite the efforts in the literature, state-of-the-art models face the problem of handling changes in the graph structure by relying on prior knowledge, compromising the model's flexibility. In this paper, we propose a graph-size invariant probabilistic generative model, named FUDGE, Fully Dynamic Graph Evolution, for predicting the graph evolution through step-wise changes in the graph structure. FUDGE can generate evolving graphs by exploring the whole node space, thus ensuring fast and effective generation. We evaluate FUDGE on real and synthetic benchmark datasets and compare its performance against state-of-the-art competitors. The results demonstrate that our approach offers a competitive advantage in generation and prediction quality compared to existing literature. The code is publicly available at https://github.com/FuDGE2023/fudge.
Keywords:
Graph generation
Graph convolutional network
Temporal graph
Deep learning
Graph evolution
Journal
J
IF:
3.4
Papers:
78
Citations:
0
Organization
View more organizations
Cited Papers
ShareSave
ShareSaveA traffic flow forecasting model based on dynamic graph learning and temporally adaptive attention.png)
Safety Science
Safety ScienceIF5.4
PREAI
ShareSaveShareSave View more