A Proof Of The Block Model Threshold Conjecture

Combinatorica, Volume abs/1311.4115, Issue 3, 2018.

Cited by: 178|Bibtex|Views38|DOI:https://doi.org/10.1007/s00493-016-3238-8
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|link.springer.com|arxiv.org

Abstract:

We study a random graph model called the “stochastic block model” in statistics and the “planted partition model” in theoretical computer science. In its simplest form, this is a random graph with two equal-sized classes of vertices, with a within-class edge probability of q and a between-class edge probability of q′.

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments