mlsanityData to 7 Oct 2026

Hypergraph Generation via Structured Stochastic Diffusion

arXiv 2605.05024 ↗First posted 6 May 2026stat.ML cs.LG stat.COcited by 0

Not on the map. Why?

Abstract (arXiv)

Hypergraphs model higher-order interactions, but realistic hypergraph generation remains difficult because incidence, hyperedge-size heterogeneity, and overlap structure are not faithfully captured by pairwise reductions. We propose HEDGE, a generative model defined directly on relaxed incidence matrices via a structured stochastic diffusion. The forward process combines a hypergraph-specific two-sided heat operator with an Ornstein--Uhlenbeck component, preserving structure-aware noising near the data while yielding an explicit Gaussian terminal law. Conditional on an observed hypergraph, this forward process is linear-Gaussian, so conditional means, covariances, scores, and reverse-drift targets are available in closed form. We therefore learn a permutation-equivariant state-only reverse-drift field in incidence space by regressing onto exact conditional targets, and generate samples by simulating a learned reverse-time SDE from the Gaussian base law. We establish exactness in the ideal state-only setting together with finite-horizon stability guarantees, and empirically show improved hypergraph generation quality relative to strong baselines.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 45 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

24 of 45 references.

References · 24

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2022Flow Matching for Generative Modelingcited by 5,426
  4. 2022DiGress: Discrete Denoising diffusion for graph generationcited by 503
  5. 2018Invariant and Equivariant Graph Networkscited by 339
  6. 2020Networks beyond pairwise interactions: structure and dynamicscited by 127
  7. 2021You are AllSet: A Multiset Function Framework for Hypergraph Neural Networkscited by 124
  8. 2022SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generatorscited by 96
  9. 2018Simplicial Closure and higher-order link predictioncited by 92
  10. 2024Generator Matching: Generative modeling with arbitrary Markov processescited by 82
  11. 2024DeFoG: Discrete Flow Matching for Graph Generationcited by 76
  12. 2021Generative hypergraph clustering: from blockmodels to modularitycited by 48
12 more
  1. 2020Structural Patterns and Generative Models of Real-world Hypergraphscited by 29
  2. 2015Consistency of Spectral Hypergraph Partitioning under Planted Partition Modelcited by 23
  3. 2022Transport Elliptical Slice Samplingcited by 12
  4. 2023Tuning-Free Maximum Likelihood Training of Latent Variable Models via Coin Bettingcited by 11
  5. 2024HYGENE: A Diffusion-based Hypergraph Generation Methodcited by 8
  6. 2019Latent Space Modelling of Hypergraph Datacited by 6
  7. 2022SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategycited by 6
  8. 2025DHG-Bench: A Comprehensive Benchmark for Deep Hypergraph Learningcited by 5
  9. 2021Gaussian Processes on Hypergraphscited by 4
  10. 2022Finding Bipartite Components in Hypergraphscited by 4
  11. 2025Denoising Diffused Embeddings: a Generative Approach for Hypergraphscited by 4
  12. 2026Generator-based Graph Generation via Heat Diffusioncited by 1

Built on by

Not cited yet.