EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks

Abstract Higher-order relationships exist widely across different disciplines. In the realm of real-world systems, significant interactions involving multiple entities are common. The traditional pairwise modeling approach leads to the loss of important higher-order structures, while hypergraph is one of the most typical representations of higher-order relationships. To deeply explore the higher-order relationships, researchers and practitioners use hypergraph analysis to model the higher-order relationships and describe the important topological features in higher-order networks. At the same time, they carry out hypergraph learning studies to learn better node representations by designing hypergraph neural network models. However, existing hypergraph libraries still have the following research gaps. The first is that most of them are not able to support both hypergraph analysis and hypergraph learning, which negatively impacts the user experience. The second is that the existing libraries exhibit insufficient computational performance, which causes researchers and practitioners to spend more time and incur expensive resource costs. To fill these research gaps, we present EasyHypergraph, a comprehensive, computationally efficient, and storage-saving hypergraph computational library. To ensure comprehensiveness, EasyHypergraph designs data structures to support both hypergraph analysis and hypergraph learning. To ensure fast computation and efficient memory utilization, EasyHypergraph designs the computational workflow and demonstrates its effectiveness. Through experiments on five typical hypergraph datasets, EasyHypergraph saves at most 8470 s and 935 s over two baseline libraries in terms of analyzing node distance on a dataset with more than one hundred thousand nodes. For hypergraph learning, EasyHypergraph reduces HGNN training time by approximately 70.37% in a similar scenario. Finally, by conducting case studies for hypergraph analysis and learning, EasyHypergraph exhibits its usefulness in social science research.

Authors

Institutions

Publication Details

Journal
Humanities and Social Sciences Communications
Published
2025-08-09
DOI
https://doi.org/10.1057/s41599-025-05180-5
Citations
1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
1.32

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks

Yang Chen, Xiu‐Xiu Zhan, Min Gao, Bodian Ye et al.
1 citations
Humanities and Social Sciences Communications
Complex Network Analysis Techniques
1.32
article

EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks

Yang Chen, Xiu‐Xiu Zhan, Min Gao, Bodian Ye, Zi‐Ke Zhang, Qingyuan Gong, Xin Wang, Xinlei He
article en
1 citations

Abstract

Abstract Higher-order relationships exist widely across different disciplines. In the realm of real-world systems, significant interactions involving multiple entities are common. The traditional pairwise modeling approach leads to the loss of important higher-order structures, while hypergraph is one of the most typical representations of higher-order relationships. To deeply explore the higher-order relationships, researchers and practitioners use hypergraph analysis to model the higher-order relationships and describe the important topological features in higher-order networks. At the same time, they carry out hypergraph learning studies to learn better node representations by designing hypergraph neural network models. However, existing hypergraph libraries still have the following research gaps. The first is that most of them are not able to support both hypergraph analysis and hypergraph learning, which negatively impacts the user experience. The second is that the existing libraries exhibit insufficient computational performance, which causes researchers and practitioners to spend more time and incur expensive resource costs. To fill these research gaps, we present EasyHypergraph, a comprehensive, computationally efficient, and storage-saving hypergraph computational library. To ensure comprehensiveness, EasyHypergraph designs data structures to support both hypergraph analysis and hypergraph learning. To ensure fast computation and efficient memory utilization, EasyHypergraph designs the computational workflow and demonstrates its effectiveness. Through experiments on five typical hypergraph datasets, EasyHypergraph saves at most 8470 s and 935 s over two baseline libraries in terms of analyzing node distance on a dataset with more than one hundred thousand nodes. For hypergraph learning, EasyHypergraph reduces HGNN training time by approximately 70.37% in a similar scenario. Finally, by conducting case studies for hypergraph analysis and learning, EasyHypergraph exhibits its usefulness in social science research.

Humanities and Social Sciences CommunicationsVol. 12(1)
Hangzhou Normal University (CN), Fudan University (CN), Communication University of Zhejiang (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 17%
Complex Network Analysis Techniques
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.