TY - JOUR
T1 - Hypergraphx
T2 - a library for higher-order network analysis
AU - Lotito, Quintino Francesco
AU - Contisciani, Martina
AU - De Bacco, Caterina
AU - Di Gaetano, Leonardo
AU - Gallo, Luca
AU - Montresor, Alberto
AU - Musciotto, Federico
AU - Ruggeri, Nicolò
AU - Battiston, Federico
N1 - Publisher Copyright:
© The authors 2023. Published by Oxford University Press. All rights reserved.
PY - 2023/6/1
Y1 - 2023/6/1
N2 - From social to biological systems, many real-world systems are characterized by higher-order, non-dyadic interactions. Such systems are conveniently described by hypergraphs, where hyperedges encode interactions among an arbitrary number of units. Here, we present an open-source python library, hypergraphx (HGX), providing a comprehensive collection of algorithms and functions for the analysis of higher-order networks. These include different ways to convert data across distinct higher-order representations, a large variety of measures of higher-order organization at the local and the mesoscale, statistical filters to sparsify higher-order data, a wide array of static and dynamic generative models, and an implementation of different dynamical processes with higher-order interactions. Our computational framework is general, and allows to analyse hypergraphs with weighted, directed, signed, temporal and multiplex group interactions. We provide visual insights on higher-order data through a variety of different visualization tools. We accompany our code with an extended higher-order data repository and demonstrate the ability of HGX to analyse real-world systems through a systematic analysis of a social network with higher-order interactions. The library is conceived as an evolving, community-based effort, which will further extend its functionalities over the years. Our software is available at https://github.com/HGX-Team/hypergraphx.
AB - From social to biological systems, many real-world systems are characterized by higher-order, non-dyadic interactions. Such systems are conveniently described by hypergraphs, where hyperedges encode interactions among an arbitrary number of units. Here, we present an open-source python library, hypergraphx (HGX), providing a comprehensive collection of algorithms and functions for the analysis of higher-order networks. These include different ways to convert data across distinct higher-order representations, a large variety of measures of higher-order organization at the local and the mesoscale, statistical filters to sparsify higher-order data, a wide array of static and dynamic generative models, and an implementation of different dynamical processes with higher-order interactions. Our computational framework is general, and allows to analyse hypergraphs with weighted, directed, signed, temporal and multiplex group interactions. We provide visual insights on higher-order data through a variety of different visualization tools. We accompany our code with an extended higher-order data repository and demonstrate the ability of HGX to analyse real-world systems through a systematic analysis of a social network with higher-order interactions. The library is conceived as an evolving, community-based effort, which will further extend its functionalities over the years. Our software is available at https://github.com/HGX-Team/hypergraphx.
KW - complex networks
KW - higher-order networks
KW - hypergraphs
KW - network analysis
UR - http://www.scopus.com/inward/record.url?scp=85161042763&partnerID=8YFLogxK
U2 - 10.1093/comnet/cnad019
DO - 10.1093/comnet/cnad019
M3 - Article
AN - SCOPUS:85161042763
SN - 2051-1310
VL - 11
JO - Journal of Complex Networks
JF - Journal of Complex Networks
IS - 3
M1 - cnad019
ER -