Community Detection in Large Hypergraphs
arXiv:2301.11226 · doi:10.1126/sciadv.adg9159
Abstract
Hypergraphs, describing networks where interactions take place among any number of units, are a natural tool to model many real-world social and biological systems. In this work we propose a principled framework to model the organization of higher-order data. Our approach recovers community structure with accuracy exceeding that of currently available state-of-the-art algorithms, as tested in synthetic benchmarks with both hard and overlapping ground-truth partitions. Our model is flexible and allows capturing both assortative and disassortative community structures. Moreover, our method scales orders of magnitude faster than competing algorithms, making it suitable for the analysis of very large hypergraphs, containing millions of nodes and interactions among thousands of nodes. Our work constitutes a practical and general tool for hypergraph analysis, broadening our understanding of the organization of real-world higher-order systems.
References in corpus (38)
- Networks beyond pairwise interactions: structure and dynamics
- Detecting rich-club ordering in complex networks
- The physics of higher-order interactions in complex systems
- Simplicial models of social contagion
- Mixed membership stochastic blockmodels
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Evolutionary dynamics of higher-order interactions in social networks
- Simplicial Closure and higher-order link prediction
- The ground truth about metadata and community detection in networks
- Structure and inference in annotated networks
- Structure and dynamics of core-periphery networks
- Explosive higher-order Kuramoto dynamics on simplicial complexes
- Higher-order interactions in complex networks of phase oscillators promote abrupt synchronization switching
- Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes
- Random walks on hypergraphs
- Community detection, link prediction, and layer interdependence in multilayer networks
- Multiorder Laplacian for synchronization in higher-order networks
- Efficiently inferring community structure in bipartite networks
- Higher-order motif analysis in hypergraphs
- Multi-body Interactions and Non-Linear Consensus Dynamics on Networked Systems
- Chaos in generically coupled phase oscillator networks with nonpairwise interactions
- Inference of hyperedges and overlapping communities in hypergraphs
- Hypergraph reconstruction from network data
- Simplicial contagion in temporal higher-order networks
- Unveiling the higher-order organization of multivariate time series
- Explosive cooperation in social dilemmas on higher-order networks
- Evolutionary game model of group choice dilemmas on hypergraphs
- Rich-cores in networks
- Community detection with node attributes in multilayer networks
- Mapping flows on hypergraphs
- Hypergraphx: a library for higher-order network analysis
- Spectral Detection on Sparse Hypergraphs
- Reciprocity, community detection, and link prediction in dynamic networks
- Exact and sampling methods for mining higher-order motifs in large hypergraphs
- Generative model for reciprocity and community detection in networks
- A framework to generate hypergraphs with community structure
- Community detection and reciprocity in networks by jointly modeling pairs of edges
- Nonparametric Modeling of Higher-Order Interactions via Hypergraphons
Cited by in corpus (14)
- The simpliciality of 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
- Collective dynamics on higher-order networks
- Multiplex measures for higher-order networks
- 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
- Finding Influential Cores via Normalized Ricci Flows in Directed and Undirected Hypergraphs with Applications
- Higher-order shortest paths in hypergraphs
- Inference and Visualization of Community Structure in Attributed Hypergraphs Using Mixed-Membership Stochastic Block Models
- Sampling nodes and hyperedges via random walks on large hypergraphs