Query-Limited Community Recovery in Stochastic Block Models
Researchers have developed new spectral algorithms for community detection in hypergraphs, improving upon existing methods for non-uniform models. One paper introduces a three-step spectral algorithm that achieves partial recovery and weak consistency, particularly for sparse random hypergraphs with bounded expected degrees. Another paper establishes a sharp threshold for exact recovery in the general non-uniform hypergraph stochastic block model, proposing efficient algorithms that attain optimal performance. AI
IMPACT Advances in hypergraph community detection could lead to more sophisticated network analysis and pattern recognition in complex systems.