Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional Network
The analysis of networks, including social, citation, biological, and traffic networks, has become a critical research area, enabling deeper insights into complex systems across diverse fields. Traditional Graph Convolutional Networks (GCNs) have demonstrated success in graph representation learning...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10942338/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849770205638557696 |
|---|---|
| author | Qingwei Wen |
| author_facet | Qingwei Wen |
| author_sort | Qingwei Wen |
| collection | DOAJ |
| description | The analysis of networks, including social, citation, biological, and traffic networks, has become a critical research area, enabling deeper insights into complex systems across diverse fields. Traditional Graph Convolutional Networks (GCNs) have demonstrated success in graph representation learning, particularly in homophilic networks where nodes share similar features. However, these models struggle in heterophilic networks, where connected nodes exhibit dissimilar properties, leading to performance degradation due to ineffective feature propagation. Existing approaches have attempted to address these limitations by incorporating higher-order neighborhood aggregation and signed message passing, yet they often fail to preserve network topology while maintaining computational efficiency. This research addresses the fundamental challenge of learning robust representations in heterophilic graphs by introducing Higher-Order Graph Convolutional Network (HiGCN), a novel framework that effectively models both homophilic and heterophilic interactions through a structured Petal-Complex (PC) model. The proposed approach employs a two-step random walk mechanism between core and petal regions, facilitating bidirectional information transfer while preserving the inherent graph structure. Furthermore, adaptive spectral filters across distinct Petal-Complex Laplacian spectral domains enable the effective capture of both localized and global structural patterns in combinatorial arc-transitive complexes. Our experimental evaluations on various benchmark graph datasets—including both homogeneous and heterogeneous structures—demonstrate that HiGCN significantly outperforms state-of-the-art models in node classification and graph classification tasks, particularly in domains such as bioinformatics, social networks, and recommendation systems. The findings highlight HiGCN’s potential to enhance higher-order graph learning, making it a promising solution for complex relational modeling in diverse applications. |
| format | Article |
| id | doaj-art-780530fa9ca7473ca298e4bd3f8f89cb |
| institution | DOAJ |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-780530fa9ca7473ca298e4bd3f8f89cb2025-08-20T03:03:07ZengIEEEIEEE Access2169-35362025-01-0113558995591410.1109/ACCESS.2025.355501110942338Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional NetworkQingwei Wen0https://orcid.org/0009-0000-6045-5013Mathematics School, Jilin University, Changchun, Jilin, ChinaThe analysis of networks, including social, citation, biological, and traffic networks, has become a critical research area, enabling deeper insights into complex systems across diverse fields. Traditional Graph Convolutional Networks (GCNs) have demonstrated success in graph representation learning, particularly in homophilic networks where nodes share similar features. However, these models struggle in heterophilic networks, where connected nodes exhibit dissimilar properties, leading to performance degradation due to ineffective feature propagation. Existing approaches have attempted to address these limitations by incorporating higher-order neighborhood aggregation and signed message passing, yet they often fail to preserve network topology while maintaining computational efficiency. This research addresses the fundamental challenge of learning robust representations in heterophilic graphs by introducing Higher-Order Graph Convolutional Network (HiGCN), a novel framework that effectively models both homophilic and heterophilic interactions through a structured Petal-Complex (PC) model. The proposed approach employs a two-step random walk mechanism between core and petal regions, facilitating bidirectional information transfer while preserving the inherent graph structure. Furthermore, adaptive spectral filters across distinct Petal-Complex Laplacian spectral domains enable the effective capture of both localized and global structural patterns in combinatorial arc-transitive complexes. Our experimental evaluations on various benchmark graph datasets—including both homogeneous and heterogeneous structures—demonstrate that HiGCN significantly outperforms state-of-the-art models in node classification and graph classification tasks, particularly in domains such as bioinformatics, social networks, and recommendation systems. The findings highlight HiGCN’s potential to enhance higher-order graph learning, making it a promising solution for complex relational modeling in diverse applications.https://ieeexplore.ieee.org/document/10942338/Deep learninghigh-ordergraph convolutional networknode classification graph classificationnetwork topologymulti-domain graph |
| spellingShingle | Qingwei Wen Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional Network IEEE Access Deep learning high-order graph convolutional network node classification graph classification network topology multi-domain graph |
| title | Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional Network |
| title_full | Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional Network |
| title_fullStr | Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional Network |
| title_full_unstemmed | Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional Network |
| title_short | Modeling Higher-Order Interactions in Graphs Through Combinatorial Arc-Transitive Structure Using Graph Convolutional Network |
| title_sort | modeling higher order interactions in graphs through combinatorial arc transitive structure using graph convolutional network |
| topic | Deep learning high-order graph convolutional network node classification graph classification network topology multi-domain graph |
| url | https://ieeexplore.ieee.org/document/10942338/ |
| work_keys_str_mv | AT qingweiwen modelinghigherorderinteractionsingraphsthroughcombinatorialarctransitivestructureusinggraphconvolutionalnetwork |