How robust are reconstruction thresholds for community detection?
The stochastic block model is one of the oldest and most ubiquitous models for studying clustering and community detection. In an exciting sequence of developments, motivated by deep but non-rigorous ideas from statistical physics, Decelle et al. conjectured a sharp threshold for when community dete...
Main Authors: | Moitra, Ankur, Perry, Amelia E., Wein, Alexander Spence |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Published: |
Association for Computing Machinery (ACM)
2018
|
Online Access: | http://hdl.handle.net/1721.1/116100 https://orcid.org/0000-0001-7047-0495 https://orcid.org/0000-0002-7254-7959 https://orcid.org/0000-0002-3406-1747 |
Similar Items
-
Optimality and sub-optimality of PCA I: Spiked random matrix models
by: Perry, Amelia E., et al.
Published: (2020) -
Message-Passing Algorithms for Synchronization Problems over Compact Groups
by: Perry, Amelia, et al.
Published: (2021) -
Spectral methods from tensor networks
by: Moitra, Ankur, et al.
Published: (2021) -
Settling the Robust Learnability of Mixtures of Gaussians
by: Liu, Allen, et al.
Published: (2022) -
Robustly Learning General Mixtures of Gaussians
by: Liu, Allen, et al.
Published: (2023)