activity
20002026
most citedSpectral redemption: clustering sparse networks

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

collaborators
Showing 2004Show all

8 papers · 1 filter

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…

cs.CC2004★ 8 cited

A New Look at Survey Propagation and its Generalizations

Eliza N. Maneva, Elchanan Mossel, Martin J. Wainwright

This paper provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effect…

q-bio.PE2004★ 26 cited

How much can evolved characters tell us about the tree that generated them?

Elchanan Mossel, Mike Steel

In this paper we review some recent results that shed light on a fundamental question in molecular systematics: how much phylogenetic `signal' can we expect from characters that ha…

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 . 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 parties, who have noisy versions…

q-bio.MN2004

Random autocatalytic networks

Elchanan Mossel, Mike Steel

We determine conditions under which a random biochemical system is likely to contain a subsystem that is both autocatalytic and able to survive on some ambient `food' source. Such…

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…

math.CO2004★ 2 cited

Distorted metrics on trees and phylogenetic forests

Elchanan Mossel

We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a binary tree on leaves with a path metric , consider the pairwise distan…