Reconstruction in the Labeled Stochastic Block Model

02/11/2015
by   Marc Lelarge, et al.
0

The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two endpoints belong to the same community or not. It has been conjectured in Heimlicher12 that correlated reconstruction (i.e. identification of a partition correlated with the true partition into the underlying communities) would be feasible if and only if a model parameter exceeds a threshold. We prove one half of this conjecture, i.e., reconstruction is impossible when below the threshold. In the positive direction, we introduce a weighted graph to exploit the label information. With a suitable choice of weight function, we show that when above the threshold by a specific constant, reconstruction is achieved by (1) minimum bisection, (2) a semidefinite relaxation of minimum bisection, and (3) a spectral method combined with removal of edges incident to vertices of high degree. Furthermore, we show that hypothesis testing between the labeled stochastic block model and the labeled Erdős-Rényi random graph model exhibits a phase transition at the conjectured reconstruction threshold.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2018

Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach

We study the problem of community detection in a random hypergraph model...
research
04/11/2019

Community Detection in the Sparse Hypergraph Stochastic Block Model

We consider the community detection problem in sparse random hypergraphs...
research
11/02/2015

An Impossibility Result for Reconstruction in a Degree-Corrected Planted-Partition Model

We consider a Degree-Corrected Planted-Partition model: a random graph o...
research
07/14/2021

Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities

We consider the task of learning latent community structure from multipl...
research
06/22/2019

The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations

The tree reconstruction problem is to collect and analyze massive data a...
research
03/26/2023

Weak Recovery Threshold for the Hypergraph Stochastic Block Model

We study the problem of weak recovery for the r-uniform hypergraph stoch...
research
06/05/2020

Linear Programming and Community Detection

The problem of community detection with two equal-sized communities is c...

Please sign up or login with your details

Forgot password? Click here to reset