Elchanan Mossel | Academic Influence

Elchanan Mossel's AcademicInfluence.com Rankings

Elchanan Mossel

Mathematics

#3337

World Rank

#4945

Historical Rank

Probability Theory

#58

World Rank

#80

Historical Rank

Statistics

#505

World Rank

#583

Historical Rank

Measure Theory

#1852

World Rank

#2264

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Elchanan Mossel's Degrees

PhD Statistics Stanford University
Bachelors Mathematics Tel Aviv University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Elchanan Mossel Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference. Research Mossel's research spans a number of topics across mathematics, statistics, economics, and computer science, including combinatorial statistics, discrete function inequalities, isoperimetry, game theory, social choice, computational complexity, and computational evolutionary biology.

(See a Problem?)

Elchanan Mossel's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (2004) (735)
Spectral redemption in clustering sparse networks (2013) (581)
Noise stability of functions with low influences: Invariance and optimality (2005) (519)
On approximately fair allocations of indivisible goods (2004) (445)
Reconstruction and estimation in the planted partition model (2015) (322)
A Proof of the Block Model Threshold Conjecture (2013) (279)
On the submodularity of influence in social networks (2006) (259)
Stochastic Block Models and Reconstruction (2012) (204)
Noisy sorting without resampling (2007) (189)
Learning nonsingular phylogenies and hidden Markov models (2005) (185)
Consistency Thresholds for the Planted Bisection Model (2014) (176)
Incomplete Lineage Sorting: Consistent Phylogeny Estimation from Multiple Loci (2007) (171)
Glauber dynamics on trees and hyperbolic graphs (2001) (169)
Phylogenetic MCMC Algorithms Are Misleading on Mixtures of Trees (2005) (167)
Belief propagation, robust reconstruction and optimal recovery of block models (2013) (166)
Conditional hardness for approximate coloring (2005) (162)
A new look at survey propagation and its generalizations (2004) (156)
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms (2007) (152)
Reconstruction on Trees: Beating the Second Eigenvalue (2001) (132)
Gaussian Bounds for Noise Correlation of Functions (2007) (132)
Learning juntas (2003) (128)
Learning functions of k relevant variables (2004) (124)
Majority dynamics and aggregation of information in social networks (2012) (124)
Information flow on trees (2001) (122)
Approximation Resistant Predicates from Pairwise Independence (2008) (121)
Strategic Learning and the Topology of Social Networks (2012) (115)
Random biochemical networks: the probability of self-sustaining autocatalysis. (2005) (113)
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (2004) (104)
Submodularity of Influence in Social Networks: From Local to Global (2010) (103)
Survey: Information Flow on Trees (2004) (103)
Exact thresholds for Ising–Gibbs samplers on general graphs (2009) (102)
Optimal phylogenetic reconstruction (2005) (94)
Phase transitions in phylogeny (2003) (94)
Consistency Thresholds for Binary Symmetric Block Models (2014) (94)
Online conflict-free coloring for intervals (2005) (88)
Sorting and Selection in Posets (2007) (86)
On Reverse Hypercontractivity (2011) (82)
On the hardness of sampling independent sets beyond the tree threshold (2007) (82)
On the Impossibility of Reconstructing Ancestral Data and Phylogenies (2003) (79)
Opinion Exchange Dynamics (2014) (76)
The geometry of manipulation — A quantitative proof of the Gibbard-Satterthwaite theorem (2009) (76)
Robust reconstruction on trees is determined by the second eigenvalue (2004) (75)
Mixing times of the biased card shuffling and the asymmetric exclusion process (2002) (75)
Asymptotic learning on Bayesian social networks (2012) (75)
On the mixing time of a simple random walk on the super critical percolation cluster (2000) (74)
Sorting from Noisy Information (2009) (71)
Contextual Stochastic Block Models (2018) (71)
Evolutionary trees and the Ising model on the Bethe lattice: a proof of Steel’s conjecture (2005) (68)
How much can evolved characters tell us about the tree that generated them? (2004) (66)
A phase transition for a random cluster model on phylogenetic trees. (2004) (65)
Truthful Fair Division (2010) (65)
On ε-biased generators in NC 0 (2006) (63)
Maximally stable Gaussian partitions with discrete applications (2009) (63)
On the noise sensitivity of monotone functions (2003) (60)
On e-Biased Generators in NC0 (2003) (58)
Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes (2008) (58)
Distorted Metrics on Trees and Phylogenetic Forests (2004) (58)
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels (2006) (57)
The weak limit of Ising models on locally tree-like graphs (2009) (57)
Robust Optimality of Gaussian Noise Stability (2012) (56)
Coin flipping from a cosmic source: On error correction of truly random bits (2004) (56)
Seeded graph matching via large neighborhood statistics (2018) (53)
Reaching Consensus on Social Networks (2010) (53)
Inapproximability for VCG-based combinatorial auctions (2010) (52)
Robust dimension free isoperimetry in Gaussian space (2012) (51)
A quantitative Gibbard-Satterthwaite theorem without neutrality (2011) (49)
On the complexity of approximating the VC dimension (2001) (48)
Learning DNF from random walks (2003) (47)
Local Algorithms for Block Models with Side Information (2015) (46)
Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny (2005) (46)
Efficient Bayesian Learning in Social Networks with Gaussian Estimators (2010) (46)
Recursive reconstruction on periodic trees (1998) (45)
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep (2008) (45)
On the Influence of the Seed Graph in the Preferential Attachment Model (2014) (42)
A quantitative Arrow theorem (2009) (42)
Gibbs rapidly samples colorings of G(n, d/n) (2007) (41)
On Random Graph Homomorphisms into Z (2000) (41)
The Complexity of Distinguishing Markov Random Fields (2008) (40)
Global and Local Information in Clustering Labeled Block Models (2014) (39)
On Extracting Common Random Bits From Correlated Sources (2010) (39)
Mixed-up Trees: the Structure of Phylogenetic Mixtures (2007) (39)
Rapid mixing of Gibbs sampling on graphs that are sparse on average (2007) (38)
Shotgun Assembly of Labeled Graphs (2015) (37)
Mafia: A theoretical study of players and coalitions in a partial information environment (2006) (37)
Nearest-neighbor walks with low predictability profile and percolation in 2 + ε dimensions (1998) (37)
Density Evolution in the Degree-correlated Stochastic Block Model (2015) (37)
On ε‐biased generators in NC0 (2006) (36)
Shuffling by semi-random transpositions (2004) (35)
Harmonicity and invariance on slices of the Boolean cube (2015) (33)
Invariance Principle on the Slice (2015) (32)
A Smooth Transition from Powerlessness to Absolute Power (2012) (31)
Can one hear the shape of a population history? (2014) (29)
The Computational Complexity of Estimating MCMC Convergence Time (2011) (27)
Social Learning Equilibria (2012) (26)
Learning restricted Boltzmann machines via influence maximization (2018) (25)
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems (2006) (25)
New Coins From Old: Computing With Unknown Bias (2003) (25)
Non interactive simulation of correlated distributions is decidable (2017) (25)
Majority is stablest: discrete and SoS (2012) (25)
Geometric influences (2009) (25)
Nearest-neighbor walks with low predictability profile and percolation in $2+\epsilon$ dimensions (1998) (24)
Smooth compression, Gallager bound and nonlinear sparse-graph codes (2008) (23)
Rational Groupthink (2014) (23)
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity (2018) (23)
A Spectral Approach to Analysing Belief Propagation for 3-Colouring (2007) (23)
Real Analysis in Computer Science: A collection of Open Problems (2014) (22)
Maximal Accurate Forests from Distance Matrices (2006) (22)
Bayesian Decision Making in Groups is Hard (2017) (21)
On the Speed of Social Learning (2014) (21)
Coexistence in Preferential Attachment Networks (2013) (20)
On the Impossibility of Learning the Missing Mass (2015) (20)
On Agreement and Learning (2012) (20)
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model (2014) (20)
A law of large numbers for weighted majority (2004) (19)
Making Consensus Tractable (2010) (19)
Standard simplices and pluralities are not the most noise stable (2014) (19)
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters (2011) (18)
On Extracting Common Random Bits From Correlated Sources on Large Alphabets (2010) (18)
Competing first passage percolation on random regular graphs (2011) (17)
Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard (2018) (17)
Geometric influences II: Correlation inequalities and noise sensitivity (2012) (17)
Groupthink and the Failure of Information Aggregation in Large Groups (2014) (16)
Pebble Games and Complexity (2013) (16)
On the Inference of Large Phylogenies with Long Branches: How Long Is Too Long? (2010) (16)
Connectivity and Equilibrium in Random Games (2007) (15)
Slow emergence of cooperation for win-stay lose-shift on trees (2005) (15)
A note on the Entropy/Influence conjecture (2011) (15)
Deep Learning and Hierarchal Generative Models (2016) (15)
Shotgun assembly of random jigsaw puzzles (2016) (14)
Broadcasting on Random Directed Acyclic Graphs (2018) (14)
On epsilon-Biased Generators in NC0 (2003) (14)
Sequence assembly from corrupted shotgun reads (2016) (14)
Majority rule has transition ratio 4 on Yule trees under a 2-state symmetric model. (2014) (13)
New Maximally Stable Gaussian Partitions with Discrete Applications (2009) (12)
When More Information Reduces the Speed of Learning (2014) (12)
A Spectral Approach to Analyzing Belief Propagation for 3-Coloring (2007) (12)
Linear Sketching over F_2 (2018) (12)
Quickest online selection of an increasing subsequence of specified size (2014) (11)
On /spl epsiv/-biased generators in NC/sup 0/ (2003) (11)
Shotgun assembly of random regular graphs (2015) (11)
Complete characterization of functions satisfying the conditions of Arrow’s theorem (2009) (11)
Percolation in a dependent random environment (2000) (11)
Energy of Flows on Percolation Clusters (2001) (11)
How Many Subpopulations Is Too Many? Exponential Lower Bounds for Inferring Population Histories (2018) (11)
The Minesweeper Game: Percolation and Complexity (2002) (10)
Is your function low dimensional? (2018) (10)
Junta Correlation is Testable (2019) (10)
On the correlation of increasing families (2015) (10)
A Geometric Model of Opinion Polarization (2019) (10)
Seeding with Costly Network Information (2019) (10)
Noise correlation bounds for uniform low degree functions (2009) (10)
Bayesian Group Decisions: Algorithms and Complexity (2017) (10)
VC bounds on the cardinality of nearly orthogonal function classes (2010) (10)
From Agreement to Asymptotic Learning (2011) (10)
Spectral recovery of binary censored block models (2021) (10)
Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent (2015) (10)
AND testing and robust judgement aggregation (2019) (10)
The probability of intransitivity in dice and close elections (2018) (9)
Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies (2011) (9)
Phylogenetic mixtures: Concentration of measure in the large-tree limit (2011) (9)
Strong Contraction and Influences in Tail Spaces (2014) (9)
Election manipulation: the average case (2012) (8)
Long ties accelerate noisy threshold-based contagions (2018) (8)
Gaussian bounds for noise correlation of resilient functions (2017) (8)
Exit time tails from pairwise decorrelation in hidden Markov chains, with applications to dynamical percolation (2011) (7)
The Computational Complexity of Estimating Convergence Time (2010) (7)
Corruption Detection on Networks (2015) (7)
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension (2009) (7)
Iterative maximum likelihood on networks (2009) (7)
Shotgun Assembly of Erdos-Renyi Random Graphs (2020) (7)
Noise Stability Is Computable and Approximately Low-Dimensional (2017) (6)
Noise Stability and Correlation with Half Spaces (2016) (6)
Distance-based species tree estimation under the coalescent: Information-theoretic trade-off between number of loci and sequence length (2017) (6)
Broadcasting on Random Networks (2019) (6)
Shrinkage Effect in Ancestral Maximum Likelihood (2008) (6)
Approximating Partition Functions in Constant Time (2017) (6)
Co-evolution Is Incompatible with the Markov Assumption in Phylogenetics (2010) (5)
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation (2019) (5)
Lower Bounds on Same-Set Inner Product in Correlated Spaces (2015) (5)
Arrow's Impossibility Theorem Without Unanimity (2009) (5)
Phylogenetic information complexity: is testing a tree easier than finding it? (2008) (5)
Parallels Between Phase Transitions and Circuit Complexity? (2019) (4)
Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't (2018) (4)
Noise Stability is computable and low dimensional (2017) (4)
Complexity of Bayesian belief exchange over a network (2017) (4)
Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory (2010) (4)
The Vertex Sample Complexity of Free Energy is Polynomial (2018) (4)
Learning to Sample from Censored Markov Random Fields (2021) (4)
Product Space Models of Correlation: Between Noise Stability and Additive Combinatorics (2015) (4)
Majority Is Asymptotically the Most Stable Resilient Function (2017) (4)
Agnostically Learning Juntas from Random Walks (2008) (4)
Reconstruction on Trees and Low-Degree Polynomials (2021) (3)
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles (2009) (3)
Mixing under monotone censoring (2013) (3)
Coalescent-based species tree estimation: a stochastic Farris transform (2017) (3)
Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies (2012) (3)
Linear Sketching over 𝔽2 (2016) (3)
In Defense of Liquid Democracy (2021) (3)
Broadcasting on Two-Dimensional Regular Grids (2020) (3)
In Defense of Fluid Democracy (2021) (3)
Almost-Linear Planted Cliques Elude the Metropolis Process (2022) (3)
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees (2022) (3)
The Circuit Complexity of Inference (2019) (3)
A second moment proof of the spread lemma (2022) (3)
A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements (2022) (2)
Spoofing Generalization: When Can't You Trust Proprietary Models? (2021) (2)
Spectral Algorithms Optimally Recover (Censored) Planted Dense Subgraphs (2022) (2)
Response to Comment on "Phylogenetic MCMC Algorithms Are Misleading on Mixtures of Trees" (2006) (2)
Harmonicity and invariance on slices of the Boolean cube (2019) (2)
Multiple Random Oracles Are Better Than One (2008) (2)
Branching Process Approach for 2-Sat Thresholds (2008) (2)
Opinion Dynamics under Social Pressure (2021) (2)
Regular graphs with linearly many triangles (2019) (2)
Arrow's Impossibility Without Unanimity (2009) (2)
Broadcasting on Bounded Degree DAGs (2018) (2)
Distributed Corruption Detection in Networks (2015) (2)
Probabilistic Aspects of Voting, Intransitivity and Manipulation (2020) (2)
Information Spread with Error Correction (2021) (2)
Reconstruction on 2D Regular Grids (2021) (2)
On the Second Kahn-Kalai Conjecture (2022) (2)
The weak limit of Ising models on locally tree-like graphs (2010) (2)
Efficient Reconstruction of Stochastic Pedigrees: Some Steps From Theory to Practice (2022) (1)
Is your data low-dimensional? (2018) (1)
The Power of Two Matrices in Spectral Algorithms (2022) (1)
Spectral Algorithms Optimally Recover Planted Sub-structures (2022) (1)
Inference in Opinion Dynamics under Social Pressure (2021) (1)
Regular Graphs with Many Triangles are Structured (2022) (1)
Special Issue on Analysis of Boolean Functions: Guest Editors' Foreword (2013) (1)
Probabilistic view of voting, paradoxes, and manipulation (2021) (1)
Explicit Optimal Hardness via Gaussian Stability Results (2012) (1)
Linear Sketching over $\mathbb F_2$ (2016) (1)
A quantitative Gibbard-Satterthwaite theorem without neutrality (2014) (1)
Efficient Reconstruction of Stochastic Pedigrees (2020) (1)
Combinatorial Auctions : VC v . VCG (2008) (1)
Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit (2012) (1)
Simplicity and Complexity in Belief Propagation - 1 (2020) (0)
A Phase Transition in Arrow's Theorem (2020) (0)
Phylogenetic signal, phase translations and limits to resolving deep divergences (2004) (0)
Gaussian bounds for noise correlation of resilient functions (2019) (0)
When will (game) wars end? (2023) (0)
Robust testing of low dimensional functions (2020) (0)
Sorting and Selection in Posets | SIAM Journal on Computing | Vol. 40, No. 3 | Society for Industrial and Applied Mathematics (2011) (0)
S I ] 1 0 M ay 2 01 9 Seeding with Costly Network Information (2019) (0)
A Mathematical Model for Curriculum Learning (2023) (0)
Standard simplices and pluralities are not the most noise stable (2016) (0)
Distributional Analysis of Recursive Algorithms by the Contraction MethodRalph NeiningerUniversity of FreiburgNovember (1999) (0)
Agreement and Statistical Efficiency in Bayesian Perception Models (2022) (0)
Social Networks and Social Choice Lecture Date : September 7 , 2010 Lecture : Aggregation of General Biased Signals (2010) (0)
Nearest-neighbor walks with low predictability pro leand percolation in 2 + " dimensionsOlle (1998) (0)
C O ] 1 6 A ug 2 01 9 The extreme upper tail for triangles in random regular graphs (2019) (0)
Lecture: Aggregation of General Biased Signals (2010) (0)
10-11-2003 Learning DNF From Random Walks (2017) (0)
A Proof of the Block Model Threshold Conjecture (2017) (0)
Is this correct? Let's check! (2022) (0)
PR ] 2 8 Ju l 2 01 5 STRONG CONTRACTION AND INFLUENCES IN TAIL SPACES (0)
Approximate polymorphisms (2021) (0)
Computation in anonymous networks (2013) (0)
PR ] 2 2 Fe b 20 13 Robust Optimality of Gaussian Noise Stability (2017) (0)
On the Complexity of Approximating the V C Dimension (2014) (0)
Foundations of Decision Making with Behavioral and Computational Constraints (2019) (0)
Lecture: Condorcet's Theorem (2010) (0)
Simplicity and Complexity in Belief Propagation - 3 (2020) (0)
Asymptotic learning on Bayesian social networks (2013) (0)
Fe b 20 18 Social Learning Equilibria (2018) (0)
The geometry of manipulation — A quantitative proof of the Gibbard-Satterthwaite theorem (2012) (0)
Combinatorial Statistics on Trees and Networks (2010) (0)
Majority dynamics and aggregation of information in social networks (2013) (0)
MCMC Learning (2013) (0)
A Statistical Test for Clades in Phylogenies (2014) (0)
The extreme upper tail for triangles in random regular graphs (2019) (0)
Lecture : Some non-martingale learning models (2010) (0)
ST ] 2 5 M ay 2 01 9 Social Learning Equilibria * (2019) (0)
Complete characterization of functions satisfying the conditions of Arrow’s theorem (2011) (0)
Ensembles of Factor Graphs (2006) (0)
Sharp thresholds in inference of planted subgraphs (2023) (0)
The Power of an Adversary in Glauber Dynamics (2023) (0)
Per olation in a Dependent Random EnvironmentJohan (2000) (0)
Scaling Limits for Width Two Partially Ordered Sets: The Incomparability Window (2012) (0)
Shotgun Assembly of Erd\H{o}s-R\'enyi Random Graphs. (2020) (0)
Non-backtracking random walks (2017) (0)
P R ] 15 F eb 2 01 1 Connectivity and Equilibrium in Random Games (2011) (0)
PR ] 2 2 M ar 2 00 8 Branching Process approach for 2-SAT thresholds (2009) (0)
Lecture: Consensus, bribe and marketing (2010) (0)
Ju l 2 02 1 In Defense of Fluid Democracy (2021) (0)
Reconstruction and estimation in the planted partition model (2014) (0)
The C2M project: a wrapper generator for chemistry and biology (2004) (0)
Scaling Limits for Width Two Partially Ordered Sets: The Incomparability Window (2008) (0)
1 1 N ov 2 01 6 Linear Sketching over F 2 (2016) (0)
A quantitative Arrow theorem (2011) (0)
10-2012 A Quantitative Arrow Theorem (2017) (0)
Maximally stable Gaussian partitions with discrete applications (2011) (0)
Random autocatalytic networks (2004) (0)
Mcmc Learning Elchanan Mossel (2015) (0)
Mathematics of Evolution and Phylogeny Library of Congress Cataloging in Publication Data (data Available) (2004) (0)
On Reverse Hypercontractivity (2013) (0)
Seeding with Partial Network Information : Hardness and Guarantees (2019) (0)
Lecture: Errors in Binary Voting (2010) (0)

This paper list is powered by the following services:

Other Resources About Elchanan Mossel

en.wikipedia.org

What Schools Are Affiliated With Elchanan Mossel?

Elchanan Mossel is affiliated with the following schools: