#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2008

2018

- This year (3)
- Last 5 years (25)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Elchanan Mossel, Joe Neeman, Allan Sly
- ArXiv
- 2013

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… (More)

- Florent Krzakala, Cristopher Moore, +4 authors Pan Zhang
- Proceedings of the National Academy of Sciences…
- 2013

Spectral algorithms are classic approaches to clustering and community detection in networks. However, for sparse networks the standard versions of these algorithms are suboptimal, in some cases… (More)

- Elchanan Mossel, Joe Neeman, Allan Sly
- COLT
- 2014

We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities a/n and b/n for interand intra-block edge probabilities respectively. It was… (More)

- Elchanan Mossel, Joe Neeman, Allan Sly
- ArXiv
- 2014

We consider the problem of reconstructing symmetric block models with two blocks of n vertices each and connection probabilities pn and qn for interand intra-block edge probabilities respectively. We… (More)

- Dohyung Park, Joe Neeman, Jin Zhang, Sujay Sanghavi, Inderjit S. Dhillon
- ICML
- 2015

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

- Jess Banks, Cristopher Moore, Joe Neeman, Praneeth Netrapalli
- ArXiv
- 2016

- Elchanan Mossel, Joe Neeman, Allan Sly
- STOC
- 2015

The planted bisection model is a random graph model in which the nodes are divided into two equal-sized communities and then edges are added randomly in a way that depends on the community… (More)

- Elchanan Mossel, Joe Neeman, Omer Tamuz
- Autonomous Agents and Multi-Agent Systems
- 2013

Consider $$n$$ n individuals who, by popular vote, choose among $$q \ge 2$$ q ≥ 2 alternatives, one of which is “better” than the others. Assume that each individual votes independently at random,… (More)

- Anindya De, Elchanan Mossel, Joe Neeman
- STOC
- 2013

The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension… (More)

We prove that under the Gaussian measure, half-spaces are uniquely the most noise stable sets. We also prove a quantitative version of uniqueness, showing that a set which is almost optimally noise… (More)