Exact Recovery of Community Detection in k-Community Gaussian Mixture Model

arXiv2009.01185MaRDI QIDQ6348262FDOQ6348262

Zhongyang Li

Publication date: 29 August 2020

Abstract: We study the community detection problem on a Gaussian mixture model, in which vertices are divided into $kgeq2$ 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 threshold for the exact recovery of the maximum likelihood estimation. Applications include the community detection on hypergraphs.

This page was built for publication: Exact Recovery of Community Detection in k-Community Gaussian Mixture Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348262)