E
Elchanan Mossel
Researcher at Massachusetts Institute of Technology
Publications - 404
Citations - 14813
Elchanan Mossel is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Random graph & Bounded function. The author has an hindex of 62, co-authored 387 publications receiving 13335 citations. Previous affiliations of Elchanan Mossel include Microsoft & Weizmann Institute of Science.
Papers
More filters
Journal ArticleDOI
Spectral redemption in clustering sparse networks
Florent Krzakala,Cristopher Moore,Elchanan Mossel,Joe Neeman,Allan Sly,Lenka Zdeborová,Pan Zhang +6 more
TL;DR: A way of encoding sparse data using a “nonbacktracking” matrix, and it is shown that the corresponding spectral algorithm performs optimally for some popular generative models, including the stochastic block model.
Journal ArticleDOI
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
TL;DR: This paper shows a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of $\alpha_{\text{\tiny{GW}}} + \epsilon$ for all $\ep silon > 0$, and indicates that the geometric nature of the Goemans-Williamson algorithm might be intrinsic to the MAX- CUT problem.
Proceedings ArticleDOI
On approximately fair allocations of indivisible goods
TL;DR: In the presence of indivisibilities, it is shown that there exist allocations in which the envy is bounded by the maximum marginal utility, and an algorithm for computing such allocations is presented.
Journal ArticleDOI
Reconstruction and estimation in the planted partition model
TL;DR: This work establishes a rigorous connection between the clustering problem, spin-glass models on the Bethe lattice and the so called reconstruction problem and provides a simple and efficient algorithm for estimating a and b when clustering is possible.
Proceedings ArticleDOI
Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?
TL;DR: Though it is unable to prove the majority is stablest conjecture, some partial results are enough to imply that MAX-CUT is hard to (3/4 + 1/(2/spl pi/) + /spl epsi/)-approximate (/spl ap/ .909155), assuming only the unique games conjecture.