Generating graph-structured data is a challenging problem, which requires
learning the underlying distribution of graphs. Various models such as graph
VAE, graph GANs, and graph diffusion models have been proposed to generate
meaningful and reliable graphs, among which the diffusion models have achieved
state-of-the-art performance. In this paper, we argue that running full-rank
diffusion SDEs on the whole graph adjacency matrix space hinders diffusion
models from learning graph topology generation, and hence significantly
deteriorates the quality of generated graph data. To address this limitation,
we propose an efficient yet effective Graph Spectral Diffusion Model (GSDM),
which is driven by low-rank diffusion SDEs on the graph spectrum space. Our
spectral diffusion model is further proven to enjoy a substantially stronger
theoretical guarantee than standard diffusion models. Extensive experiments
across various datasets demonstrate that, our proposed GSDM turns out to be the
SOTA model, by exhibiting both significantly higher generation quality and much
less computational consumption than the baselines.

该论文提出了一种基于图谱扩散的高效而有效的 Graph Spectral Diffusion Model （GSDM），相较于基于整个图邻接矩阵空间的扩散模型，该模型能够更好地学习生成拓扑结构更好的图数据，而实验结果表明该模型不仅可以生成质量更高、而且计算消耗也更小。