HYVINT: Intensity-Driven Hypergraph Generation with Variational Representations

• URL: http://arxiv.org/abs/2605.16836v1
• Date: Sat, 16 May 2026 06:38:33 GMT
• Title: HYVINT: Intensity-Driven Hypergraph Generation with Variational Representations
• Abstract summary: Hypergraphs provide a principled framework for modeling polyadic interactions.<n>Existing generators often rely on implicit latent spaces or continuous incidence decoders.<n>We propose HYVINT, an intensity-driven hypergraph generative framework.
• Score: 14.364205966885805
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hypergraphs provide a principled framework for modeling polyadic interactions, with applications in recommendation systems, social networks, and molecular modeling. Hypergraph generation remains challenging because incidence structures are discrete, sparse, and governed by heterogeneous higher-order interactions. Existing generators often rely on implicit latent spaces or continuous incidence decoders, which provide limited mechanistic interpretation of how node-hyperedge incidences arise. To address these limitations, we propose HYVINT, an intensity-driven hypergraph generative framework. Our key innovations are twofold: (i) we develop an intensity-driven incidence formation mechanism for hypergraphs that links latent interaction strength to binary incidence, and (ii) we derive a tractable lower-bound variational estimator for learning latent representations. We provide generation error bounds with asymptotic convergence rates and empirically show that HYVINT achieves strong fidelity while maintaining substantial novelty and diversity on synthetic and real-world hypergraphs.

Related papers

• Hypergraph Neural Diffusion: A PDE-Inspired Framework for Hypergraph Message Passing [6.809465248544176]
  Hypergraph Neural Diffusion is a novel framework that unifies nonlinear diffusion equations with neural message passing on hypergraphs.<n>We derive rigorous theoretical guarantees, including energy dissipation, solution boundedness via a discrete maximum principle, and stability under explicit and implicit numerical schemes.<n>Our results highlight the power of PDE-inspired design in enhancing the stability, expressivity, and interpretability of hypergraph learning.
  arXiv  Detail & Related papers  (2026-04-13T03:52:01Z)
• Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger [16.833612337456373]
  We present a novel Heat-Exchanger with Adaptive Locality for Hypergraph Neural Network (HealHGNN)<n>HealHGNN is designed as a node-hyperedge bidirectional systems with linear complexity in the number of nodes and hyperedges.<n>Experiments on both homophilic and heterophilic cases show that HealHGNN achieves the state-of-the-art performance.
  arXiv  Detail & Related papers  (2026-02-28T11:36:35Z)
• Hyper-KGGen: A Skill-Driven Knowledge Extractor for High-Quality Knowledge Hypergraph Generation [63.4604143884703]
  Hyper-KGGen is a skill-driven framework that reformulates extraction as a skill-evolving process.<n>It incorporates an textitadaptive skill acquisition module that actively distills domain expertise into a Global Skill Library.<n>We present textbfHyperDocRED, a rigorously annotated benchmark for document-level knowledge hypergraph extraction.
  arXiv  Detail & Related papers  (2026-02-23T06:32:00Z)
• BHyGNN+: Unsupervised Representation Learning for Heterophilic Hypergraphs [50.161252392272324]
  We introduce BHyGNN+, a self-supervised learning framework for representation learning on heterophilic hypergraphs.<n>By contrasting augmented views of a hypergraph against its dual using cosine similarity, our framework captures essential structural patterns in a fully unsupervised manner.<n>Our results validate the effectiveness of leveraging hypergraph duality for self-supervised learning.
  arXiv  Detail & Related papers  (2026-02-16T16:55:37Z)
• Hypergraph Contrastive Learning for both Homophilic and Heterophilic Hypergraphs [36.44792866509702]
  Hypergraph neural networks (HNNs) have been widely used to capture complex high-order relationships.<n>We propose textbfHONOR, a novel unsupervised textbfHypergraph ctextbfONtrastive learning framework suitable for both homtextbfOphilic and hetetextbfRophilic hypergraphs.
  arXiv  Detail & Related papers  (2025-11-24T05:35:46Z)
• Implicit Hypergraph Neural Networks: A Stable Framework for Higher-Order Relational Learning with Provable Guarantees [8.5183483099116]
  We introduce Implicit Hypergraph Neural Networks (IHGNN), which computes representations as the solution to a nonlinear fixed-point equation.<n>IHGNN consistently outperforms strong traditional graph/hypergraph neural network baselines in both accuracy and robustness.
  arXiv  Detail & Related papers  (2025-08-13T02:06:29Z)
• Community and hyperedge inference in multiple hypergraphs [9.782518418521175]
  We show how to utilize interconnections between multiple hypergraphs to synthesize integrated information from multiple higher-order systems.<n>We propose a model based on the block model, which integrates information from multiple hypergraphs to reveal latent high-order structures.<n>Our work provides a practical and flexible tool for analyzing multiple hypergraphs, greatly advancing the understanding of the organization in real-world high-order systems.
  arXiv  Detail & Related papers  (2025-05-08T05:52:41Z)
• HYGENE: A Diffusion-based Hypergraph Generation Method [6.997955138726617]
  We introduce a diffusion-based Hypergraph Generation (HYGENE) method that addresses challenges through a progressive local expansion approach.<n>Experiments demonstrated the effectiveness of HYGENE, proving its ability to closely mimic a variety of properties in hypergraphs.
  arXiv  Detail & Related papers  (2024-08-29T11:45:01Z)
• Hypergraph Transformer for Semi-Supervised Classification [50.92027313775934]
  We propose a novel hypergraph learning framework, HyperGraph Transformer (HyperGT) HyperGT uses a Transformer-based neural network architecture to effectively consider global correlations among all nodes and hyperedges. It achieves comprehensive hypergraph representation learning by effectively incorporating global interactions while preserving local connectivity patterns.
  arXiv  Detail & Related papers  (2023-12-18T17:50:52Z)
• From Hypergraph Energy Functions to Hypergraph Neural Networks [94.88564151540459]
  We present an expressive family of parameterized, hypergraph-regularized energy functions. We then demonstrate how minimizers of these energies effectively serve as node embeddings. We draw parallels between the proposed bilevel hypergraph optimization, and existing GNN architectures in common use.
  arXiv  Detail & Related papers  (2023-06-16T04:40:59Z)
• Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative [126.0985540285981]
  We apply the contrastive learning approach from images/graphs (we refer to it as HyperGCL) to improve generalizability of hypergraph neural networks. We fabricate two schemes to augment hyperedges with higher-order relations encoded, and adopt three augmentation strategies from graph-structured data. We propose a hypergraph generative model to generate augmented views, and then an end-to-end differentiable pipeline to jointly learn hypergraph augmentations and model parameters.
  arXiv  Detail & Related papers  (2022-10-07T20:12:20Z)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.