activity
20002026
most citedSpectral redemption: clustering sparse networks

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

collaborators
Showing 2012Show all

13 papers · 1 filter

cs.CC2012★ 6 cited

Majority is Stablest : Discrete and SoS

Anindya De, Elchanan Mossel, Joe Neeman

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 inducti…

math.PR2012

Robust Optimality of Gaussian Noise Stability

Elchanan Mossel, Joe Neeman

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 almos…

cs.GT2012★ 84 cited

Strategic Learning and the Topology of Social Networks

Elchanan Mossel, Allan Sly, Omer Tamuz

We consider a group of strategic agents who must each repeatedly take one of two possible actions. They learn which of the two actions is preferable from initial private signals, a…

cs.IT2012

On extracting common random bits from correlated sources on large alphabets

Siu On Chan, Elchanan Mossel, Joe Neeman

Suppose Alice and Bob receive strings and each uniformly random in but so that and are correlated . For each symbol , we have…

math.PR2012★ 79 cited

Asymptotic Learning on Bayesian Social Networks

Elchanan Mossel, Allan Sly, Omer Tamuz

Understanding information exchange and aggregation on networks is a central problem in theoretical economics, probability and statistics. We study a standard model of economic agen…

math.ST2012★ 73 cited

Majority Dynamics and Aggregation of Information in Social Networks

Elchanan Mossel, Joe Neeman, Omer Tamuz

Consider n individuals who, by popular vote, choose among q >= 2 alternatives, one of which is "better" than the others. Assume that each individual votes independently at random,…

math.ST2012★ 27 cited

Social learning equilibria

Elchanan Mossel, Manuel Mueller-Frank, Allan Sly +1

We consider a large class of social learning models in which a group of agents face uncertainty regarding a state of the world, share the same utility function, observe private sig…

math.PR2012★ 4 cited

Geometric Influences II: Correlation Inequalities and Noise Sensitivity

Nathan Keller, Elchanan Mossel, Arnab Sen

In a recent paper, we presented a new definition of influences in product spaces of continuous distributions, and showed that analogues of the most fundamental results on discrete…

cs.GT2012★ 2 cited

A Smooth Transition from Powerlessness to Absolute Power

Elchanan Mossel, Ariel D. Procaccia, Miklos Z. Racz

We study the phase transition of the coalitional manipulation problem for generalized scoring rules. Previously it has been shown that, under some conditions on the distribution of…

cs.CC2012

Explicit Optimal Hardness via Gaussian stability results

Anindya De, Elchanan Mossel

The results of Raghavendra (2008) show that assuming Khot's Unique Games Conjecture (2002), for every constraint satisfaction problem there exists a generic semi-definite program t…

math.PR2012★ 48 cited

Robust dimension free isoperimetry in Gaussian space

Elchanan Mossel, Joe Neeman

We prove the first robust dimension free isoperimetric result for the standard Gaussian measure and the corresponding boundary measure in . The main re…

math.PR2012★ 139 cited

Stochastic Block Models and Reconstruction

Elchanan Mossel, Joe Neeman, Allan Sly

The planted partition model (also known as the stochastic blockmodel) is a classical cluster-exhibiting random graph model that has been extensively studied in statistics, physics,…

cs.GT2012★ 1 cited

Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit

Elchanan Mossel, Omer Tamuz

We consider an auction of identical digital goods to customers whose valuations are drawn independently from known distributions. Myerson's classic result identifies the truthful m…