FuDGE: Modeling full dynamic graph evolution

Abstract

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 $$\textrm{FuDGE}$$ , Fully Dynamic Graph Evolution, for predicting the graph evolution through step-wise changes in the graph structure. $$\textrm{FuDGE}$$ can generate evolving graphs by exploring the whole node space, thus ensuring fast and effective generation. We evaluate $$\textrm{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 .

Publication
J. Intell. Inf. Syst.