activity
20122017
most citedInformation-theoretic thresholds for community detection in sparse networks

44 citations · 82 across the 5 of their papers we have counts for

collaborators

9 papers

cs.CC2017

Non interactive simulation of correlated distributions is decidable

Anindya De, Elchanan Mossel, Joe Neeman

A basic problem in information theory is the following: Let be an arbitrary distribution where the marginals and a…

math.PR20171 cited

Noise Stability is computable and low dimensional

Anindya De, Elchanan Mossel, Joe Neeman

Questions of noise stability play an important role in hardness of approximation in computer science as well as in the theory of voting. In many applications, the goal is to find a…

math.PR201644 cited

Information-theoretic thresholds for community detection in sparse networks

Jess Banks, Cristopher Moore, Joe Neeman +1

We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, consider the symmetric stochastic block m…

math.PR2016

An interpolation proof of Ehrhard's inequality

Joe Neeman, Grigoris Paouris

We prove Ehrhard's inequality using interpolation along the Ornstein-Uhlenbeck semi-group. We also provide an improved Jensen inequality for Gaussian variables that might be of ind…

math.PR2016

Noise Stability and Correlation with Half Spaces

Elchanan Mossel, Joe Neeman

Benjamini, Kalai and Schramm showed that a monotone function is noise stable if and only if it is correlated with a half-space (a set of the form $\{x…

stat.ML201531 cited

Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons

Dohyung Park, Joe Neeman, Jin Zhang +2

In this paper we consider the collaborative ranking setting: a pool of users each provides a small number of pairwise preferences between possible items; from these we need to…