Exact recovery of community detection in k-community Gaussian mixture models

Abstract

We study the community detection problem on a Gaussian mixture model, in which vertices are divided into $k\geq 2$ distinct communities. The major difference in our model is that the intensities for Gaussian perturbations are different for different entries in the observation matrix, and we do not assume that every community has the same number of vertices. We explicitly find the necessary and sufficient conditions for the exact recovery of the maximum likelihood estimation, which can give a sharp phase transition for the exact recovery even though the Gaussian perturbations are not identically distributed; see Section 7. Applications include the community detection on hypergraphs.

Keywords

• Gaussian mixture model
• community detection
• maximum likelihood estimation
• exact recovery
• 62H30
• 62F12
• 68W40
• 68Q25