Hypergraph Neural Diffusion: A PDE-Inspired Framework for Hypergraph Message Passing

TL;DR

This paper introduces Hypergraph Neural Diffusion (HND), a PDE-inspired framework for hypergraph message passing that enhances stability, interpretability, and performance in hypergraph neural networks.

Contribution

HND unifies nonlinear diffusion equations with neural message passing, providing a physically interpretable, stable, and adaptable hypergraph learning framework with theoretical guarantees.

Findings

HND achieves competitive results on benchmark datasets.

The PDE-based formulation offers interpretability and stability in hypergraph learning.

HND supports various numerical schemes for deep and stable architectures.

Abstract

Hypergraph neural networks (HGNNs) have shown remarkable potential in modeling high-order relationships that naturally arise in many real-world data domains. However, existing HGNNs often suffer from shallow propagation, oversmoothing, and limited adaptability to complex hypergraph structures. In this paper, we propose Hypergraph Neural Diffusion (HND), a novel framework that unifies nonlinear diffusion equations with neural message passing on hypergraphs. HND is grounded in a continuous-time hypergraph diffusion equation, formulated via hypergraph gradient and divergence operators, and modulated by a learnable, structure-aware coefficient matrix over hyperedge-node pairs. This partial differential equation (PDE) based formulation provides a physically interpretable view of hypergraph learning, where feature propagation is understood as an anisotropic diffusion process governed by local inconsistency and adaptive diffusion coefficient. From this perspective, neural message passing becomes a discretized gradient flow that progressively minimizes a diffusion energy functional. We derive rigorous theoretical guarantees, including energy dissipation, solution boundedness via a discrete maximum principle, and stability under explicit and implicit numerical schemes. The HND framework supports a variety of integration strategies such as non-adaptive-step (like Runge-Kutta) and adaptive-step solvers, enabling the construction of deep, stable, and interpretable architectures. Extensive experiments on benchmark datasets demonstrate that HND achieves competitive performance. Our results highlight the power of PDE-inspired design in enhancing the stability, expressivity, and interpretability of hypergraph learning.