Diffusion-based Graph Generative Methods
Hongyang Chen, Can Xu, Lingyu Zheng, Qiang Zhang, Xuemin Lin
TL;DR
This work surveys diffusion-based graph generative methods, detailing three core paradigms—DDPMs, SGMs, and Score SDEs—and their adaptations to graph data. It offers a structured taxonomy of diffusion backbones, enhancement strategies for discrete and non-Euclidean graphs, and a comprehensive account of applications in AI for scientific discovery, computer vision, and generic graph generation. The review also compiles datasets and evaluation metrics across tasks, and discusses limitations and future directions, arguing that it is among the most exhaustive analyses to date. Overall, the paper provides practical guidance for selecting diffusion frameworks, tailoring them to graph structures, and benchmarking across standard domains to advance graph-oriented generation research.
Abstract
Being the most cutting-edge generative methods, diffusion methods have shown great advances in wide generation tasks. Among them, graph generation attracts significant research attention for its broad application in real life. In our survey, we systematically and comprehensively review on diffusion-based graph generative methods. We first make a review on three mainstream paradigms of diffusion methods, which are denoising diffusion probabilistic models, score-based genrative models, and stochastic differential equations. Then we further categorize and introduce the latest applications of diffusion models on graphs. In the end, we point out some limitations of current studies and future directions of future explorations. The summary of existing methods metioned in this survey is in https://github.com/zhejiangzhuque/Diffusion-based-Graph-Generative-Methods.
