Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
The binary symmetric stochastic block model deals with a random graph of n vertices partitioned into two equal-sized clusters, such that each pair of vertices is independently connected with probability p within clusters and q across clusters. In the asymptotic regime of p = a log n/n and q = …