IDEAS home Printed from https://ideas.repec.org/a/pal/palcom/v12y2025i1d10.1057_s41599-025-05180-5.html
   My bibliography  Save this article

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

Author

Listed:
  • Bodian Ye

    (Fudan University)

  • Min Gao

    (Fudan University)

  • Xiu-Xiu Zhan

    (Hangzhou Normal University)

  • Xinlei He

    (Hong Kong University of Science and Technology (Guangzhou))

  • Zi-Ke Zhang

    (Zhejiang University)

  • Qingyuan Gong

    (Fudan University)

  • Xin Wang

    (Fudan University)

  • Yang Chen

    (Fudan University)

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.

Suggested Citation

  • Bodian Ye & Min Gao & Xiu-Xiu Zhan & Xinlei He & Zi-Ke Zhang & Qingyuan Gong & Xin Wang & Yang Chen, 2025. "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks," Palgrave Communications, Palgrave Macmillan, vol. 12(1), pages 1-19, December.
  • Handle: RePEc:pal:palcom:v:12:y:2025:i:1:d:10.1057_s41599-025-05180-5
    DOI: 10.1057/s41599-025-05180-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/s41599-025-05180-5
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/s41599-025-05180-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:palcom:v:12:y:2025:i:1:d:10.1057_s41599-025-05180-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: https://www.nature.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.