Community Detection in the Hypergraph SBM: Optimal Recovery Given the Similarity Matrix. (arXiv:2208.12227v1 [cs.SI])

Community detection is a fundamental problem in network science. In this
paper, we consider community detection in hypergraphs drawn from the
$hypergraph$ $stochastic$ $block$ $model$ (HSBM), with a focus on exact
community recovery. We study the performance of polynomial-time algorithms for
community detection in a case where the full hypergraph is unknown. Instead, we
are provided a $similarity$ $matrix$ $W$, where $W_{ij}$ reports the number of
hyperedges containing both $i$ and $j$. Under this information model, Kim,
Bandeira, and Goemans …

arxiv community detection hypergraph recovery