Inference of hyperedges and overlapping communities in hypergraphs

Abstract

Hypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks. Here we propose a framework based on statistical inference to characterize the structural organization of hypergraphs. The method allows to infer missing hyperedges of any size in a principled way, and to jointly detect overlapping communities in presence of higher-order interactions. Furthermore, our model has an efficient numerical implementation, and it runs faster than dyadic algorithms on pairwise records projected from higher-order data. We apply our method to a variety of real-world systems, showing strong performance in hyperedge prediction tasks, detecting communities well aligned with the information carried by interactions, and robustness against addition of noisy hyperedges. Our approach illustrates the fundamental advantages of a hypergraph probabilistic model when modeling relational systems with higher-order interactions.

References in corpus (5)

• Community detection in networks: A user guide
• The physics of higher-order interactions in complex systems
• Mitigation of infectious disease at school: targeted class closure vs school closure
• Random walks on hypergraphs
• Clustering in graphs and hypergraphs with categorical edge labels

Cited by in corpus (23)

• Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes
• Community Detection in Large Hypergraphs
• Local dominance unveils clusters in networks
• Hypergraphx: a library for higher-order network analysis
• Hypergraph reconstruction from dynamics
• Structure and inference in hypergraphs with node attributes
• Hyperlink communities in higher-order networks
• Collective dynamics on higher-order networks
• A framework to generate hypergraphs with community structure
• Multiplex measures for higher-order networks
• The structural evolution of temporal hypergraphs through the lens of hyper-cores
• Beyond Pairwise Interactions: Unveiling the Role of Higher-Order Interactions via Stepwise Reduction
• Mining higher-order triadic interactions
• Dynamical fluctuations of random walks in higher-order networks
• Emerging Activity Temporal Hypergraph: a model for generating realistic time-varying hypergraphs
• Message-Passing on Hypergraphs: Detectability, Phase Transitions and Higher-Order Information
• Attributed Hypergraph Generation with Realistic Interplay Between Structure and Attributes
• Model-based clustering in simple hypergraphs through a stochastic blockmodel
• Community detection in hypergraphs through hyperedge percolation
• Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Models
• Emergence of network communities driven by local rules
• The relevance of higher-order ties
• HIF: The hypergraph interchange format for higher-order networks