Exact Recovery of Community Detection in k-partite Graph Models

10/10/2019
by   Zhongyang Li, et al.
0

We study the vertex classification problem on a graph in which the vertices are in k (k≥ 2) different groups, or communities, and edges are only allowed between vertices in distinct groups. The observation is the weighted adjacency matrix, perturbed by a Gaussian Orthogonal Ensemble (GOE), or Gaussian Unitary Ensemble (GUE) matrix. Different from the standard symmetric _2-synchronization in which there are 2 communities with equal number of vertices, we do not assume that the number of vertices in each group is the same. For the exact recovery of the maximum likelihood estimation (MLE) with various weighted adjacency matrix, we prove a sharp phase transition result with respect to the intensity σ of the Gaussian perturbation. These weighted adjacency matrices may be considered as natural models for the electric network. Surprisingly, the threshold, or critical value, of σ does not depend on whether or not the sample space for MLE is restricted to the classifications such that the number of vertices in each group is the same as the true value. In contrast to the well-studied _2-sychronization, a new complex version of the semi-definite programming (SDP) is designed to efficiently implement the community detection problem when the number of communities k is greater than 2, and a common region for σ such that SDP exactly recovers the true classification is obtained, which is independent of k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2020

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

We study the community detection problem on a Gaussian mixture model, in...
research
03/26/2016

Reconstructing undirected graphs from eigenspaces

In this paper, we aim at recovering an undirected weighted graph of N ve...
research
09/23/2022

Exact Recovery of Community Detection in dependent Gaussian Mixture Models

We study the community detection problem on a Gaussian mixture model, in...
research
07/13/2021

Spectral Recovery of Binary Censored Block Models

Community detection is the problem of identifying community structure in...
research
11/09/2020

Robustness of Community Detection to Random Geometric Perturbations

We consider the stochastic block model where connection between vertices...
research
02/20/2016

Semidefinite Programs for Exact Recovery of a Hidden Community

We study a semidefinite programming (SDP) relaxation of the maximum like...
research
10/30/2020

Sharp threshold for alignment of graph databases with Gaussian weights

We study the fundamental limits for reconstruction in weighted graph (or...

Please sign up or login with your details

Forgot password? Click here to reset