◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Elchanan Mossel

MIT

221 papers hereh-index 6013.5k citations347 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author10
  • first author62
  • middle author77
  • last author69

Across the 218 of 221 papers where every author was matched, so the position is known.

fields
  • math.PR87
  • cs.LG25
  • cs.CC16
  • math.CO15
  • math.ST13
  • q-bio.PE12
affiliations
  • MIT
same name
  • Elchanan Mossel — 3 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20002026
most citedSpectral redemption: clustering sparse networks

658 citations · 2.2k across the 187 of their papers we have counts for

collaborators
Showing 2004 · math.PRShow all

4 papers · 2 filters

math.PR2004★ 2 cited

Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality

Elchanan Mossel, Ryan O'Donnell, Oded Regev +2

In this paper we study non-interactive correlation distillation (NICD), a generalization of the study of noise sensitivity of boolean functions. We extend the model to NICD on tree…

math.PR2004★ 1 cited

A Law of Large Numbers for Weighted Majority

Olle Haggstrom, Gil Kalai, Elchanan Mossel

Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is p>1/2. Condorce…

math.PR2004

Coin flipping from a cosmic source: On error correction of truly random bits

Elchanan Mossel, Ryan O'Donnell

We study a problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits $x \in \bits^n$, and k parties, who have noisy versions…

math.PR2004★ 54 cited

Robust reconstruction on trees is determined by the second eigenvalue

Svante Janson, Elchanan Mossel

Consider a Markov chain on an infinite tree T=(V,E) rooted at ρ. In such a chain, once the initial root state σ(ρ) is chosen, each vertex iteratively chooses its state from the one…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.