658 citations · 1.2k across the 32 of their papers we have counts for
5 papers · 1 filter
A Proof Of The Block Model Threshold Conjecture
Elchanan Mossel, Joe Neeman, Allan Sly
We study a random graph model named the "block model" in statistics and the "planted partition model" in theoretical computer science. In its simplest form, this is a random graph…
Testing surface area with arbitrary accuracy
Joe Neeman
Recently, Kothari et al.\ gave an algorithm for testing the surface area of an arbitrary set . Specifically, they gave a randomized algorithm such that if 's…
Belief propagation, robust reconstruction and optimal recovery of block models
Elchanan Mossel, Joe Neeman, Allan Sly
We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities and for inter- and intra-block edge probabilities,…
A multidimensional version of noise stability
Joe Neeman
We give a multivariate generalization of Borell's noise stability theorem for Gaussian vectors. As a consequence we recover two inequalities, also due to Borell, for exit times of…
Spectral redemption: clustering sparse networks
Florent Krzakala, Cristopher Moore, Elchanan Mossel +4
Spectral algorithms are classic approaches to clustering and community detection in networks. However, for sparse networks the standard versions of these algorithms are suboptimal,…