mlsanityData to 14 Oct 2026

Local Message-Passing for Discrete Graph Generation

arXiv 2603.08825 ↗First posted 9 Mar 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Discrete graph generation has emerged as a powerful paradigm for modeling graph-structured data, yet state of the art models often rely on Graph Transformers or higher order architectures. We revisit this design assumption by introducing GenGNN, a modular message passing backbone for graph generation. GenGNN enables powerful generation by persisting edge fields through latent refinement of coupled node edge graph states, all without requiring global attention. Diffusion models integrating GenGNN achieve over 90 percent validity on standard benchmark datasets, performing within margins of Graph Transformer backbones and achieving up to 2x or even 5x faster inference. Systematic ablations isolate how GenGNN is resilient to oversmoothing during generative denoising, indicating each GenGNN component is necessary for downstream generation quality. Finally, representation-space analysis suggests GenGNN learns functionally similar representations to more theoretically-expressive architectures; even at deeper layers. As such, GenGNN uplifts local message-passing to challenge prevailing assumptions that performant discrete graph generation requires global attention or higher-order representations. Source Code Available Here

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 49 references that are in the map. First posted on arXiv 9 Mar 2026.

Builds on

34 of 49 references.

References · 34

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2020Denoising Diffusion Implicit Modelscited by 9,781
  4. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
  5. 2018How Powerful are Graph Neural Networks?cited by 4,393
  6. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  7. 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,333
  8. 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
  9. 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 881
  10. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  11. 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
  12. 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
22 more
  1. 2022DiGress: Discrete Denoising diffusion for graph generationcited by 520
  2. 2019Provably Powerful Graph Networkscited by 389
  3. 2017Residual Gated Graph ConvNetscited by 346
  4. 2024Generative Flows on Discrete State-Spaces: Enabling Multimodal Flows with Applications to Protein Co-Designcited by 305
  5. 2018GuacaMol: Benchmarking Models for De Novo Molecular Designcited by 297
  6. 2018Molecular Sets (MOSES): A Benchmarking Platform for Molecular Generation Modelscited by 275
  7. 2020A Note on Over-Smoothing for Graph Neural Networkscited by 249
  8. 2023Graph Inductive Biases in Transformers without Message Passingcited by 153
  9. 2025Improved Mean Flows: On the Challenges of Fastforward Generative Modelscited by 110
  10. 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classificationcited by 85
  11. 2024DeFoG: Discrete Flow Matching for Graph Generationcited by 82
  12. 2022Diffusion Models for Graphs Benefit From Discrete State Spacescited by 73
  13. 2018Generative Code Modeling with Graphscited by 60
  14. 2022On Evaluation Metrics for Graph Generative Modelscited by 46
  15. 2023Efficient and Scalable Graph Generation through Iterative Local Expansioncited by 36
  16. 2024Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNscited by 34
  17. 2023Sparse Training of Discrete Diffusion Models for Graph Generationcited by 27
  18. 2025Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellencecited by 26
  19. 2024Generative Modelling of Structurally Constrained Graphscited by 19
  20. 2025Oversmoothing, Oversquashing, Heterophily, Long-Range, and more: Demystifying Common Beliefs in Graph Machine Learningcited by 19
  21. 2023Metric Space Magnitude for Evaluating the Diversity of Latent Representationscited by 17
  22. 2024Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attentioncited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2023Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling
  2. 2025Simple and Critical Iterative Denoising: A Recasting of Discrete Diffusion in Graph Generation
  3. 2026Discrete Diffusion for Large Graph Generation via Structural Candidate Restriction
  4. 2026When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors
  5. 2024Unifying Generation and Prediction on Graphs with Latent Graph Diffusion
  6. 2025Fast Graph Generation via Autoregressive Noisy Filtration Modeling
  7. 2025Diffusion-Free Graph Generation with Next-Scale Prediction
  8. 2023Autoregressive Diffusion Model for Graph Generation