Reconstruction in the Labeled Stochastic Block Model - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Reconstruction in the Labeled Stochastic Block Model

(1, 2, 3) , (4) , (5)
1
2
3
4
5

Abstract

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 [1] that this model exhibits a phase transition: reconstruction (i.e. identification of a partition positively 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 converse direction, we introduce a suitably weighted graph. We show that when above the threshold by a specific constant, reconstruction is achieved by (1) minimum bisection, and (2) a spectral method combined with removal of nodes of high degree.
Not file

Dates and versions

hal-00917425 , version 1 (11-12-2013)

Identifiers

  • HAL Id : hal-00917425 , version 1

Cite

Marc Lelarge, Laurent Massoulié, Jiaming Xu. Reconstruction in the Labeled Stochastic Block Model. IEEE Information Theory Workshop, Sep 2013, Seville, Spain. ⟨hal-00917425⟩
242 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More