658 citations · 2.2k across the 187 of their papers we have counts for
6 papers · 1 filter
Approximating Partition Functions in Constant Time
Vishesh Jain, Frederic Koehler, Elchanan Mossel
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics a…
Coalescent-based species tree estimation: a stochastic Farris transform
Gautam Dasarathy, Elchanan Mossel, Robert Nowak +1
The reconstruction of a species phylogeny from genomic data faces two significant hurdles: 1) the trees describing the evolution of each individual gene--i.e., the gene trees--may…
Bayesian Decision Making in Groups is Hard
Jan Hązła, Ali Jadbabaie, Elchanan Mossel +1
We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions tha…
Gaussian Bounds for Noise Correlation of Resilient Functions
Elchanan Mossel
Gaussian bounds on noise correlation of functions play an important role in hardness of approximation, in quantitative social choice theory and in testing. The author (2008) obtain…
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…
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…