Tackling Over-smoothing on Hypergraphs: A Ricci Flow-guided Neural Diffusion Approach

• URL: http://arxiv.org/abs/2603.15696v1
• Date: Mon, 16 Mar 2026 06:19:19 GMT
• Title: Tackling Over-smoothing on Hypergraphs: A Ricci Flow-guided Neural Diffusion Approach
• Abstract summary: Hypergraph neural networks (HGNNs) have demonstrated strong capabilities in modeling complex higher-order relationships.<n>Existing HGNNs often suffer from over-smoothing as the number of layers increases and lack effective control over message passing among nodes.<n>We propose Ricci Flow-guided Hypergraph Neural Diffusion, a novel message passing paradigm for hypergraphs guided by discrete Ricci flow.
• Score: 11.470914132766636
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hypergraph neural networks (HGNNs) have demonstrated strong capabilities in modeling complex higher-order relationships. However, existing HGNNs often suffer from over-smoothing as the number of layers increases and lack effective control over message passing among nodes. Inspired by the theory of Ricci flow in differential geometry, we theoretically establish that introducing discrete Ricci flow into hypergraph structures can effectively regulate node feature evolution and thereby alleviate over-smoothing. Building on this insight, we propose Ricci Flow-guided Hypergraph Neural Diffusion(RFHND), a novel message passing paradigm for hypergraphs guided by discrete Ricci flow. Specifically, RFHND is based on a PDE system that describes the continuous evolution of node features on hypergraphs and adaptively regulates the rate of information diffusion at the geometric level, preventing feature homogenization and producing high-quality node representations. Experimental results show that RFHND significantly outperforms existing methods across multiple benchmark datasets and demonstrates strong robustness, while also effectively mitigating over-smoothing.

Related papers

• Fluid-DiT: Graph-Free Diffusion Transformers for Fluid Flow Simulations Learning [50.053186229257555]
  We propose a Graph-Free Diffusion Transformer that replaces graph message passing with attention-based denoising.<n>By leveraging the transformer's global receptive field, Fluid-DiT naturally captures both local flow structures and long-range correlations.<n>It consistently outperforms graph-based diffusion baselines in both sample quality and distributional accuracy.
  arXiv  Detail & Related papers  (2026-08-07T12:28:45Z)
• From Diffusion to Reaction-Diffusion: A Dynamical-Systems View of Oversmoothing in Hypergraph Neural Networks [3.3213704823862433]
  This work investigates hypergraph oversmoothing from a dynamical-systems perspective.<n>We develop a reaction--diffusion framework for depth-resistant hypergraph learning.
  arXiv  Detail & Related papers  (2026-07-17T09:04:22Z)
• Graph Navier Stokes Networks [47.79249022892634]
  We introduce Graph Navier Stokes Networks (GNSN), a novel architecture that transcends conventional diffusion-based message passing.<n>GNSN defines a dynamic velocity field on the graph to govern convection, enabling more efficient and direct message propagation.<n>GNSN consistently outperforms state-of-the-art baselines in classification accuracy.
  arXiv  Detail & Related papers  (2026-05-20T14:36:52Z)
• 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)
• ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions [64.17845687013434]
  We propose ReDiSC, a structured diffusion model for structured node classification.<n>We show that ReDiSC achieves superior or highly competitive performance compared to state-of-the-art GNN, label propagation, and diffusion-based baselines.<n> Notably, ReDiSC scales effectively to large-scale datasets on which previous structured diffusion methods fail due to computational constraints.
  arXiv  Detail & Related papers  (2025-07-19T04:46:53Z)
• Continuous Geometry-Aware Graph Diffusion via Hyperbolic Neural PDE [36.48610732998552]
  We introduce theoretical principles textite.g., field and flow, gradient, divergence, and diffusivity on a non-Euclidean manifold for HPDE integration. We propose the Hyperbolic Graph Diffusion Equation (HGDE) -- a flexible vector flow function that can be integrated to obtain expressive hyperbolic node embeddings.
  arXiv  Detail & Related papers  (2024-06-03T12:50:58Z)
• Robust Node Representation Learning via Graph Variational Diffusion Networks [7.335425547621226]
  In recent years, compelling evidence has revealed that GNN-based node representation learning can be substantially deteriorated by perturbations in a graph structure. To learn robust node representation in the presence of perturbations, various works have been proposed to safeguard GNNs. We propose the Graph Variational Diffusion Network (GVDN), a new node encoder that effectively manipulates Gaussian noise to safeguard robustness on perturbed graphs.
  arXiv  Detail & Related papers  (2023-12-18T03:18:53Z)
• Dynamic Causal Explanation Based Diffusion-Variational Graph Neural Network for Spatio-temporal Forecasting [60.03169701753824]
  We propose a novel Dynamic Diffusion-al Graph Neural Network (DVGNN) fortemporal forecasting. The proposed DVGNN model outperforms state-of-the-art approaches and achieves outstanding Root Mean Squared Error result.
  arXiv  Detail & Related papers  (2023-05-16T11:38:19Z)
• Deep Graph Neural Networks via Posteriori-Sampling-based Node-Adaptive Residual Module [65.81781176362848]
  Graph Neural Networks (GNNs) can learn from graph-structured data through neighborhood information aggregation. As the number of layers increases, node representations become indistinguishable, which is known as over-smoothing. We propose a textbfPosterior-Sampling-based, Node-distinguish Residual module (PSNR).
  arXiv  Detail & Related papers  (2023-05-09T12:03:42Z)
• Equivariant Hypergraph Diffusion Neural Operators [81.32770440890303]
  Hypergraph neural networks (HNNs) using neural networks to encode hypergraphs provide a promising way to model higher-order relations in data. This work proposes a new HNN architecture named ED-HNN, which provably represents any continuous equivariant hypergraph diffusion operators. We evaluate ED-HNN for node classification on nine real-world hypergraph datasets.
  arXiv  Detail & Related papers  (2022-07-14T06:17:00Z)
• ResNorm: Tackling Long-tailed Degree Distribution Issue in Graph Neural Networks via Normalization [80.90206641975375]
  This paper focuses on improving the performance of GNNs via normalization. By studying the long-tailed distribution of node degrees in the graph, we propose a novel normalization method for GNNs. The $scale$ operation of ResNorm reshapes the node-wise standard deviation (NStd) distribution so as to improve the accuracy of tail nodes.
  arXiv  Detail & Related papers  (2022-06-16T13:49:09Z)
• Preventing Over-Smoothing for Hypergraph Neural Networks [0.0]
  We show that the performance of hypergraph neural networks does not improve as the number of layers increases. We develop a new deep hypergraph convolutional network called Deep-HGCN, which can maintain node representation in deep layers.
  arXiv  Detail & Related papers  (2022-03-31T16:33:31Z)

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.