The problem of community detection with two equal-sized communities is closely related to the minimum graph bisection over certain random models. In stochastic block model distribution networks structure, a well-known semidefinite programming (SDP) relaxation recovers underlying whenever possible. Motivated by their superior scalability, we study theoretical performance linear (LP) relaxations ...