Semidefinite Programs for Exact Recovery of a Hidden Community

02/20/2016
by   Bruce Hajek, et al.
0

We study a semidefinite programming (SDP) relaxation of the maximum likelihood estimation for exactly recovering a hidden community of cardinality K from an n × n symmetric data matrix A, where for distinct indices i,j, A_ij∼ P if i, j are both in the community and A_ij∼ Q otherwise, for two known probability distributions P and Q. We identify a sufficient condition and a necessary condition for the success of SDP for the general model. For both the Bernoulli case (P= Bern(p) and Q= Bern(q) with p>q) and the Gaussian case (P=N(μ,1) and Q=N(0,1) with μ>0), which correspond to the problem of planted dense subgraph recovery and submatrix localization respectively, the general results lead to the following findings: (1) If K=ω( n / n), SDP attains the information-theoretic recovery limits with sharp constants; (2) If K=Θ(n/ n), SDP is order-wise optimal, but strictly suboptimal by a constant factor; (3) If K=o(n/ n) and K →∞, SDP is order-wise suboptimal. The same critical scaling for K is found to hold, up to constant factors, for the performance of SDP on the stochastic block model of n vertices partitioned into multiple communities of equal size K. A key ingredient in the proof of the necessary condition is a construction of a primal feasible solution based on random perturbation of the true cluster matrix.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/25/2015

Information Limits for Recovering a Hidden Community

We study the problem of recovering a hidden community of cardinality K f...
11/24/2014

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming

The binary symmetric stochastic block model deals with a random graph of...
02/26/2015

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions

Resolving a conjecture of Abbe, Bandeira and Hall, the authors have rece...
07/08/2015

Multisection in the Stochastic Block Model using Semidefinite Programming

We consider the problem of identifying underlying community-like structu...
06/29/2020

Non-Convex Exact Community Recovery in Stochastic Block Model

Learning community structures in graphs that are randomly generated by s...
06/21/2014

On semidefinite relaxations for the block model

The stochastic block model (SBM) is a popular tool for community detecti...
04/10/2014

Open problem: Tightness of maximum likelihood semidefinite relaxations

We have observed an interesting, yet unexplained, phenomenon: Semidefini...