Despite the recent successes of vanilla Graph Neural Networks (GNNs) on many
tasks, their foundation on pairwise interaction networks inherently limits
their capacity to discern latent higher-order interactions in complex systems.
To bridge this capability gap, we propose a novel approach exploiting the rich
mathematical theory of simplicial complexes (SCs) - a robust tool for modeling
higher-order interactions. Current SC-based GNNs are burdened by high
complexity and rigidity, and quantifying higher-order interaction strengths
remains challenging. Innovatively, we present a higher-order Flower-Petals (FP)
model, incorporating FP Laplacians into SCs. Further, we introduce a
Higher-order Graph Convolutional Network (HiGCN) grounded in FP Laplacians,
capable of discerning intrinsic features across varying topological scales. By
employing learnable graph filters, a parameter group within each FP Laplacian
domain, we can identify diverse patterns where the filters' weights serve as a
quantifiable measure of higher-order interaction strengths. The theoretical
underpinnings of HiGCN's advanced expressiveness are rigorously demonstrated.
Additionally, our empirical investigations reveal that the proposed model
accomplishes state-of-the-art (SOTA) performance on a range of graph tasks and
provides a scalable and flexible solution to explore higher-order interactions
in graphs.

针对复杂系统中的高阶交互作用，本论文提出了一种利用简单复合物的丰富数学理论的新方法，介绍了一种嵌入简单复合物中的高阶 Flower-Petals 模型，并引入了基于 FP Laplacians 的高阶图卷积网络 (HiGCN)，能够识别在不同拓扑尺度上的内在特征，通过可学习的图滤波器来量化高阶交互作用强度，实现了先进的表达能力，并在各种图任务上达到了最先进的性能。