Pith. sign in

REVIEW 4 cited by

A Survey on Graph Diffusion Models: Generative AI in Science for Molecule, Protein and Material

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.01565 v1 pith:J4TT2RBL submitted 2023-04-04 cs.LG cs.CV

classification cs.LGcs.CV
keywords diffusionmodelsgraphsurveygenerativecoverfieldsfocus
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Diffusion models have become a new SOTA generative modeling method in various fields, for which there are multiple survey works that provide an overall survey. With the number of articles on diffusion models increasing exponentially in the past few years, there is an increasing need for surveys of diffusion models on specific fields. In this work, we are committed to conducting a survey on the graph diffusion models. Even though our focus is to cover the progress of diffusion models in graphs, we first briefly summarize how other generative modeling methods are used for graphs. After that, we introduce the mechanism of diffusion models in various forms, which facilitates the discussion on the graph diffusion models. The applications of graph diffusion models mainly fall into the category of AI-generated content (AIGC) in science, for which we mainly focus on how graph diffusion models are utilized for generating molecules and proteins but also cover other cases, including materials design. Moreover, we discuss the issue of evaluating diffusion models in the graph domain and the existing challenges.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Mat\'ern Noise for Triangulation-Agnostic Flow Matching on Meshes

    cs.GR 2026-05 unverdicted novelty 7.0 of 10

    Proposes discretized Matérn process noise for triangulation-agnostic flow matching on meshes with PoissonNet denoiser, tested on elastic states and humanoid poses for meshes exceeding one million triangles.

  2. Equivariant Efficient Joint Discrete and Continuous MeanFlow for Molecular Graph Generation

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    EQUIMF is a unified equivariant framework that jointly generates discrete topologies and continuous geometries in molecular graphs via synchronized MeanFlow dynamics for efficient few-step sampling.

  3. FAROS: Fair Graph Generation via Attribute Switching Mechanisms

    cs.LG 2025-07 conditional novelty 6.0 of 10

    FAROS switches sensitive attributes on an optimal fraction of nodes at an optimal diffusion step to produce fairer generated graphs with little accuracy loss.

  4. NGTM: Substructure-based Neural Graph Topic Model for Interpretable Graph Generation

    cs.LG 2025-07 conditional novelty 5.0 of 10

    NGTM generates graphs by sampling substructures from learned topic-specific distributions and assembling them, achieving competitive quality with interpretable, controllable topics.

Pith tools