Flowette: Flow Matching with Graphette Priors for Graph Generation
On the map: Diffusion models → Flow matching, time series and science
Abstract (arXiv)
We study generative modeling of graphs with recurring subgraph motifs. We propose Flowette, a continuous flow matching framework that employs a graph neural network-based transformer to learn a velocity field over graph representations with node and edge attributes. Our model promotes topology-aware alignment through optimal transport-based coupling and encourages global structural coherence through regularisation. To incorporate domain-driven structural priors, we introduce graphettes, a new probabilistic family of graph structure models that generalize graphons via controlled structural edits for motifs such as rings, stars, and trees. We theoretically analyze the coupling, invariance, and structural properties of the framework, evaluate it on synthetic and molecular benchmarks, and isolate the contributions of the structural prior, the optimal-transport coupling, and the regularisation terms through controlled ablations. Flowette achieves competitive performance overall, attaining state-of-the-art results on several metrics across multiple benchmarks, highlighting the effectiveness of combining structural priors with flow-based training for modeling complex graph distributions.
Key facts. Cited by 2 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 54 of its 74 references that are in the map. First posted on arXiv 27 Feb 2026.
Builds on
54 of 74 references.
Closest ancestors · 20
Same direction, newest first
- 2026Prior-Informed Flow Matching for Graph Reconstruction29 Jan
- 2025Simple and Critical Iterative Denoising: A Recasting of Discrete Diffusion in Graph Generation27 Mar
- 2024DeFoG: Discrete Flow Matching for Graph Generation5 Oct
- 2024Discrete Flow Matching22 Jul
- 2024Advancing Graph Generation through Beta Diffusion13 Jun
- 2024Cometh: A continuous-time discrete-state graph diffusion model10 Jun
- 2024Variational Flow Matching for Graph Generation7 Jun
- 2024Discrete-state Continuous-time Diffusion for Graph Generation19 May
- 2024Generative Flows on Discrete State-Spaces: Enabling Multimodal Flows with Applications to Protein Co-Design7 Feb
- 2024Unifying Generation and Prediction on Graphs with Latent Graph Diffusion4 Feb
- 2023Autoregressive Diffusion Model for Graph Generation17 Jul
- 2023SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generation29 Jun
8 more
- 2023Graph Denoising Diffusion for Inverse Protein Folding29 Jun
- 2023Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling6 May
- 2022Flow Matching for Generative Modeling6 Oct
- 2022Diffusion Models for Graphs Benefit From Discrete State Spaces4 Oct
- 2022DiGress: Discrete Denoising diffusion for graph generation29 Sep
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow7 Sep
- 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations5 Feb
- 2020Permutation Invariant Graph Generation via Score-Based Generative Modeling2 Mar
Other references · 34
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2024Scaling Rectified Flow Transformers for High-Resolution Image Synthesiscited by 4,094
- 2021Structured Denoising Diffusion Models in Discrete State-Spacescited by 1,665
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2024SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformerscited by 707
- 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 647
- 2022A Continuous Time Framework for Discrete Denoising Modelscited by 437
- 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
- 2018MolGAN: An implicit generative model for small molecular graphscited by 392
- 2018GuacaMol: Benchmarking Models for De Novo Molecular Designcited by 294
22 more
- 2018Molecular Sets (MOSES): A Benchmarking Platform for Molecular Generation Modelscited by 270
- 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 231
- 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 216
- 2018Optimal Transport for structured data with application on graphscited by 170
- 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
- 2019Graph Normalizing Flowscited by 103
- 2022SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generatorscited by 96
- 2020Convergence and Stability of Graph Convolutional Networks on Large Random Graphscited by 75
- 2022A Survey on Deep Graph Generation: Methods and Applicationscited by 69
- 2020GraphGen: A Scalable Approach to Domain-agnostic Labeled Graph Generationcited by 65
- 2020Scalable Deep Generative Modeling for Sparse Graphscited by 63
- 2023Graph Generation with Diffusion Mixturecited by 52
- 2020Categorical Normalizing Flows via Continuous Transformationscited by 36
- 2023Efficient and Scalable Graph Generation through Iterative Local Expansioncited by 35
- 2014Sparse graphs using exchangeable random measurescited by 19
- 2024Homomorphism Counts for Graph Neural Networks: All About That Basiscited by 16
- 2025Graph Generative Pre-trained Transformercited by 16
- 2023Improving Graph Generation by Restricting Graph Bandwidthcited by 15
- 2023A Simple and Scalable Representation for Graph Generationcited by 15
- 2015The Class of Random Graphs Arising from Exchangeable Random Measurescited by 12
- 2023HiGen: Hierarchical Graph Generative Networkscited by 5
- 2016Sampling and Estimation for (Sparse) Exchangeable Graphscited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Bures-Wasserstein Flow Matching for Graph Generation
- 2026Latent Flow Matching for Molecular Graph Generation
- 2026Efficient Graph Generation via Direct Prediction and Flow Matching
- 2026Equivariant Efficient Joint Discrete and Continuous MeanFlow for Molecular Graph Generation
- 2026Hierarchical Discrete Flow Matching for Graph Generation
- 2026Variational Bayesian Flow Network for Graph Generation
- 2026Feasible Flow Matching for Graph Reconstruction via Within-Sampling Primal-Dual Guidance
- 2026Topological Flow Matching