作者
Elchanan Mossel, Joe Neeman, Allan Sly
发表日期
2015/8
期刊
Probability Theory and Related Fields
卷号
162
页码范围
431-461
出版商
Springer Berlin Heidelberg
简介
The planted partition model (also known as the stochastic blockmodel) is a classical cluster-exhibiting random graph model that has been extensively studied in statistics, physics, and computer science. In its simplest form, the planted partition model is a model for random graphs on nodes with two equal-sized clusters, with an between-class edge probability of and a within-class edge probability of . Although most of the literature on this model has focused on the case of increasing degrees (ie. as ), the sparse case is interesting both from a mathematical and an applied point of view. A striking conjecture of Decelle, Krzkala, Moore and Zdeborová based on deep, non-rigorous ideas from statistical physics gave a precise prediction for the algorithmic threshold of clustering in the sparse planted partition model. In particular, if and , then Decelle et al. conjectured that it is possible to cluster in a way correlated …
引用总数
20122013201420152016201720182019202020212022202320244152150787166546755426928
学术搜索中的文章
E Mossel, J Neeman, A Sly - Probability Theory and Related Fields, 2015
E Mossel, J Neeman, A Sly - arXiv preprint arXiv:1202.1499, 2012