Community detection in sparse latent space models

08/04/2020
by   Fengnan Gao, et al.
0

We show that a simple community detection algorithm originated from stochastic blockmodel literature achieves consistency, and even optimality, for a broad and flexible class of sparse latent space models. The class of models includes latent eigenmodels (arXiv:0711.1146). The community detection algorithm is based on spectral clustering followed by local refinement via normalized edge counting.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset