Skip to content

Author

Dengyi Zhao

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

From Diffusion to Reaction-Diffusion: A Dynamical-Systems View of Oversmoothing in Hypergraph Neural Networks

Higher-order couplings enhance the expressive power of hypergraph neural networks (HGNNs), but they also intensify representation collapse in deep propagation due to strong multi-way feature mixing. This work investigates hypergraph oversmoothing from a dynamical-systems perspective and develops a reaction--diffusion framework for depth-resistant hypergraph learning. By defining hypergraph gradient and divergence operators, we interpret message passing as an incidence-level diffusion process. The analysis of pure diffusion shows that its continuous semiflow exponentially contracts the null-mode-free component of node representations and drives the Dirichlet energy to zero, revealing hypergraph oversmoothing as an intrinsic transverse-energy dissipation phenomenon. Motivated by this analysis, we propose Hypergraph Neural Reaction--Diffusion (HNRD), which introduces a reaction mechanism acting on the transverse component to compensate diffusion-induced dissipation and stabilize discriminative variations. We establish global well-posedness of the proposed dynamics and prove that the null-mode-free Dirichlet energy remains bounded away from zero. A forward-Euler discretization provides a practical HNRD layer with a stability condition for deep propagation. Experiments on benchmark and synthetic heterophilic hypergraphs demonstrate that HNRD consistently improves over representative hypergraph baselines. Depth, robustness, and efficiency analyses further show that HNRD preserves stable performance and nonzero Dirichlet energy under deep propagation and perturbations. These results provide a principled dynamical framework for designing deep hypergraph architectures that maintain higher-order expressiveness without representation collapse.

Zhiheng Zhou, Mengyao Zhou, Yan-Cheng Chen et al. · 0 citations
Aug 2026

Measuring the higher-order homophily in a general social hypergraph.

Homophily, the tendency of individuals to interact with similar others, is key to understand social dynamics. This concept has traditionally been measured in a k-uniform hypergraph model that accounts group interactions involving exactly k individuals (k ≥ 2). However, real-world interactions do not always involve the same number of individuals. Thus, in this paper, we propose a new descriptive homophily measure for general social hypergraphs where group interactions involve arbitrary number of individuals. We establish constraints of monotonic and majority homophily for two-class labels, providing a framework for analyzing homophily patterns. Experiments on several datasets reveal systematic deviations in hyperedge composition associated with node class labels relative to a label-independent baseline, offering insights into homophily pattern in complex social networks. This work bridges the gap between theoretical measures and practical applications in non-uniform hypergraphs, advancing the understanding of social and structural dynamics.

Yunping Wang, Zhiheng Zhou, Mingwei Li et al. · 0 citations