Hypergraphx: a library for higher-order network analysis

Abstract

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

References in corpus (31)

• Emergence of scaling in random networks
• Finding and evaluating community structure in networks
• Community detection in graphs
• Benchmark graphs for testing community detection algorithms
• Networks beyond pairwise interactions: structure and dynamics
• The physics of higher-order interactions in complex systems
• Simplicial models of social contagion
• High-resolution measurements of face-to-face contact patterns in a primary school
• Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
• Evolutionary dynamics of higher-order interactions in social networks
• Simplicial Closure and higher-order link prediction
• Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors
• Explosive higher-order Kuramoto dynamics on simplicial complexes
• Complex Networks as Hypergraphs
• Higher-order interactions in complex networks of phase oscillators promote abrupt synchronization switching
• Can co-location be used as a proxy for face-to-face contacts?
• Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes
• Social contagion models on hypergraphs
• Random walks on hypergraphs
• Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian
• Data on face-to-face contacts in an office building suggests a low-cost vaccination strategy based on community linkers
• Multiorder Laplacian for synchronization in higher-order networks
• Simplicial Activity Driven Model
• Higher-order motif analysis in hypergraphs
• Inference of hyperedges and overlapping communities in hypergraphs
• Synchronization induced by directed higher-order interactions
• Universal nonlinear infection kernel from heterogeneous exposure on higher-order networks
• Unveiling the higher-order organization of multivariate time series
• Evolutionary game model of group choice dilemmas on hypergraphs
• Covering Problems and Core Percolations on Hypergraphs
• Turing patterns in systems with high-order interactions

Cited by in corpus (10)

• Community Detection in Large Hypergraphs
• Percolation and Topological Properties of Temporal Higher-order Networks
• Structure and inference in hypergraphs with node attributes
• Hyperlink communities in higher-order networks
• A framework to generate hypergraphs with community structure
• Multiplex measures for higher-order networks
• Higher-order shortest paths in hypergraphs
• Community detection in hypergraphs through hyperedge percolation
• HIF: The hypergraph interchange format for higher-order networks
• Identifying maximal sets of significantly interacting nodes in higher-order networks