Local Message-Passing for Discrete Graph Generation

Read full text
Authors: Jay Revolinsky, Harry Shomer, Jiliang Tang
Cited by: 0
References: 24

Abstract

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

Fields of Study & Subjects

Advanced Graph Neural Networks Graph Theory and Algorithms Generative Adversarial Networks and Image Synthesis

Publication details

Journal / source
arXiv (Cornell University)
Publication date
9 March 2026
Language
EN
Document type
Preprint