Community detection in the sparse hypergraph stochastic block model
From MaRDI portal
Publication:6074664
DOI10.1002/rsa.21006zbMath1522.05441arXiv1904.05981MaRDI QIDQ6074664
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.05981
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Density (toughness, etc.) (05C42)
Related Items (2)
Multilayer hypergraph clustering using the aggregate similarity matrix ⋮ Characterization of expansion-related properties of modular graphs
Cites Work
- Belief propagation, robust reconstruction and optimal recovery of block models
- Reconstruction and estimation in the planted partition model
- Consistency of spectral hypergraph partitioning under planted partition model
- Community detection in sparse networks via Grothendieck's inequality
- Load balancing in hypergraphs
- A proof of the block model threshold conjecture
- Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
- Broadcasting on trees and the Ising model.
- Hypergraph with sampling for image retrieval
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm
- Spectral redemption in clustering sparse networks
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Exact Recovery in the Stochastic Block Model
- Loose laplacian spectra of random hypergraphs
- Community Detection and Stochastic Block Models
- Proof of the Achievability Conjectures for the General Stochastic Block Model
- Recovery and Rigidity in a Regular Stochastic Block Model
- Graph Powering and Spectral Robustness
- On the Minimax Misclassification Ratio of Hypergraph Community Detection
- Community detection thresholds and the weak Ramanujan property
- Most Tensor Problems Are NP-Hard
- Unnamed Item
This page was built for publication: Community detection in the sparse hypergraph stochastic block model
