Community detection in hypergraphs, spiked tensor models, and Sum-of-Squares
We study the problem of community detection in hypergraphs under a stochastic block model. Similarly to how the stochastic block model in graphs suggests studying spiked random matrices, our model motivates investigating statistical and computational limits of exact recovery in certain spiked tensor...
| Principais autores: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Artigo |
| Publicado em: |
Institute of Electrical and Electronics Engineers (IEEE)
2018
|
| Acesso em linha: | http://hdl.handle.net/1721.1/116076 https://orcid.org/0000-0002-3705-5318 https://orcid.org/0000-0002-7331-7557 https://orcid.org/0000-0002-0520-1165 |
| Resumo: | We study the problem of community detection in hypergraphs under a stochastic block model. Similarly to how the stochastic block model in graphs suggests studying spiked random matrices, our model motivates investigating statistical and computational limits of exact recovery in certain spiked tensor models. In contrast with the matrix case, the spiked model naturally arising from community detection in hypergraphs is different from the one arising in the so-called tensor Principal Component Analysis model. We investigate the effectiveness of algorithms in the Sum-of-Squares hierarchy on these models. Interestingly, our results suggest that these two apparently similar models might exhibit very different computational to statistical gaps. |
|---|