Community detection in the sparse hypergraph stochastic block model
From MaRDI portal
Publication:6074664
Abstract: We consider the community detection problem in sparse random hypergraphs. Angelini et al. (2015) conjectured the existence of a sharp threshold on model parameters for community detection in sparse hypergraphs generated by a hypergraph stochastic block model. We solve the positive part of the conjecture for the case of two blocks: above the threshold, there is a spectral algorithm which asymptotically almost surely constructs a partition of the hypergraph correlated with the true partition. Our method is a generalization to random hypergraphs of the method developed by Massouli'{e} (2014) for sparse random graphs.
Recommendations
- A proof of the block model threshold conjecture
- Community detection thresholds and the weak Ramanujan property
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Community detection in sparse random networks
- Testing community structure for hypergraphs
Cites work
- A proof of the block model threshold conjecture
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Belief propagation, robust reconstruction and optimal recovery of block models
- Broadcasting on trees and the Ising model.
- Community detection and stochastic block models: recent developments
- Community detection in sparse networks via Grothendieck's inequality
- Community detection thresholds and the weak Ramanujan property
- Concentration inequalities. A nonasymptotic theory of independence
- Consistency of spectral hypergraph partitioning under planted partition model
- Exact Recovery in the Stochastic Block Model
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm
- Graph powering and spectral robustness
- Hypergraph with sampling for image retrieval
- Load balancing in hypergraphs
- Loose Laplacian spectra of random hypergraphs
- Most tensor problems are NP-hard
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- On the Minimax Misclassification Ratio of Hypergraph Community Detection
- Proof of the achievability conjectures for the general stochastic block model
- Reconstruction and estimation in the planted partition model
- Recovery and rigidity in a regular stochastic block model
- Spectral redemption in clustering sparse networks
Cited in
(26)- Finding one community in a sparse graph
- Community detection in sparse random networks
- Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions
- Graphical models based hierarchical probabilistic community discovery in large-scale social networks
- Testing community structure for hypergraphs
- Community detection in degree-corrected block models
- Characterization of expansion-related properties of modular graphs
- Community detection on Euclidean random graphs
- A Block Model for Node Popularity in Networks with Community Structure
- Learning sparse graphons and the generalized Kesten-Stigum threshold
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm
- Multilayer hypergraph clustering using the aggregate similarity matrix
- Detection thresholds for the \(\beta\)-model on sparse graphs
- Optimal couplings between sparse block models
- Message-passing on hypergraphs: detectability, phase transitions and higher-order information
- Two-sample test of stochastic block models via the maximum sampling entry-wise deviation
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging
- Sharp detection boundaries on testing dense subhypergraph
- Flow-Based Community Detection in Hypergraphs
- Probabilistic Community Detection With Unknown Number of Communities
- Community detection thresholds and the weak Ramanujan property
- Sparse random hypergraphs: non-backtracking spectra and community detection
- scientific article; zbMATH DE number 6795997 (Why is no real title available?)
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models
- Community detection in sparse networks via Grothendieck's inequality
- Consistency of spectral hypergraph partitioning under planted partition model
This page was built for publication: Community detection in the sparse hypergraph stochastic block model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074664)
