mlsanityData to 7 Oct 2026

Do Graph Diffusion Models Accurately Capture and Generate Substructure Distributions?

arXiv 2502.02488 ↗First posted 4 Feb 2025cs.LGcited by 3

On the map: Diffusion models → Flow matching, time series and science

Abstract (arXiv)

Diffusion models have gained popularity in graph generation tasks; however, the extent of their expressivity concerning the graph distributions they can learn is not fully understood. Unlike models in other domains, popular backbones for graph diffusion models, such as Graph Transformers, do not possess universal expressivity to accurately model the distribution scores of complex graph data. Our work addresses this limitation by focusing on the frequency of specific substructures as a key characteristic of target graph distributions. When evaluating existing models using this metric, we find that they fail to maintain the distribution of substructure counts observed in the training set when generating new graphs. To address this issue, we establish a theoretical connection between the expressivity of Graph Neural Networks (GNNs) and the overall performance of graph diffusion models, demonstrating that more expressive GNN backbones can better capture complex distribution patterns. By integrating advanced GNNs into the backbone architecture, we achieve significant improvements in substructure generation.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 16 of its 18 references that are in the map. First posted on arXiv 4 Feb 2025.

Builds on

16 of 18 references.

Closest ancestors · 5

Same direction, newest first

  1. 2023SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generation29 Jun
  2. 2022Diffusion Models for Graphs Benefit From Discrete State Spaces4 Oct
  3. 2022DiGress: Discrete Denoising diffusion for graph generation29 Sep
  4. 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations5 Feb
  5. 2020Permutation Invariant Graph Generation via Score-Based Generative Modeling2 Mar

Other references · 11

  1. 2018How Powerful are Graph Neural Networks?cited by 4,355
  2. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  3. 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
  4. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 440
  5. 2019Provably Powerful Graph Networkscited by 385
  6. 2018Invariant and Equivariant Graph Networkscited by 339
  7. 2021Nested Graph Neural Networkscited by 136
  8. 2023A Complete Expressiveness Hierarchy for Subgraph GNNs via Subgraph Weisfeiler-Lehman Testscited by 64
  9. 2023Graph Generation with Diffusion Mixturecited by 52
  10. 2023Equivariant Polynomials for Graph Neural Networkscited by 38
  11. 2023From Relational Pooling to Subgraph GNNs: A Universal Framework for More Expressive Graph Neural Networkscited by 17

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2022Fast Graph Generation via Spectral Diffusion
  2. 2023Autoregressive Diffusion Model for Graph Generation
  3. 2024Diffusion-based Graph Generative Methods
  4. 2025SBGD: Improving Graph Diffusion Generative Model via Stochastic Block Diffusion
  5. 2026Discrete Diffusion for Large Graph Generation via Structural Candidate Restriction
  6. 2025Graph Representation Learning with Diffusion Generative Models
  7. 2024Advancing Graph Generation through Beta Diffusion
  8. 2024Towards understanding Diffusion Models (on Graphs)