Elchanan Mossel

From MaRDI portal
Revision as of 20:05, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:185102

Available identifiers

zbMath Open mossel.elchananDBLPm/EMosselWikidataQ46076638 ScholiaQ46076638MaRDI QIDQ185102

List of research outcomes





PublicationDate of PublicationType
A phase transition in Arrow's theorem with three alternatives2024-10-09Paper
Is this correct? Let's check!2024-09-25Paper
The power of two matrices in spectral algorithms for community recovery2024-07-22Paper
Spectral recovery of binary censored block models2024-07-19Paper
Combinatorial statistics and the sciences2024-03-20Paper
Broadcasting on Two-Dimensional Regular Grids2024-03-14Paper
A Geometric Model of Opinion Polarization2024-03-05Paper
Approximate polymorphisms2023-12-08Paper
Robust testing of low dimensional functions2023-11-14Paper
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique2023-11-07Paper
Inference in Opinion Dynamics Under Social Pressure2023-10-02Paper
Influences in Mixing Measures2023-07-14Paper
Sharp thresholds in inference of planted subgraphs2023-02-28Paper
The Power of an Adversary in Glauber Dynamics2023-02-21Paper
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees2022-12-06Paper
Is this correct? Let's check!2022-11-22Paper
A second moment proof of the spread lemma2022-09-22Paper
Seeding with Costly Network Information2022-09-19Paper
On the Second Kahn--Kalai Conjecture2022-09-07Paper
https://portal.mardi4nfdi.de/entity/Q50904222022-07-18Paper
Probabilistic view of voting, paradoxes, and manipulation2022-06-15Paper
A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements2022-05-05Paper
Almost-Linear Planted Cliques Elude the Metropolis Process2022-04-04Paper
Spectral Algorithms Optimally Recover Planted Sub-structures2022-03-22Paper
Shotgun assembly of Erdős-Rényi random graphs2022-02-25Paper
Regular graphs with many triangles are structured2022-02-01Paper
Reconstruction on Trees and Low-Degree Polynomials2021-09-14Paper
Spectral Recovery of Binary Censored Block Models2021-07-13Paper
Information Spread with Error Correction2021-07-13Paper
Bayesian Decision Making in Groups is Hard2021-06-17Paper
Social Learning Equilibria2021-06-07Paper
Rational Groupthink2021-03-29Paper
AND testing and robust judgement aggregation2021-01-19Paper
Probabilistic Aspects of Voting, Intransitivity and Manipulation2020-12-18Paper
Distributed Corruption Detection in Networks2020-12-17Paper
Seeded graph matching via large neighborhood statistics2020-11-30Paper
The probability of intransitivity in dice and close elections2020-11-08Paper
Shotgun assembly of random jigsaw puzzles2020-10-26Paper
https://portal.mardi4nfdi.de/entity/Q51218962020-09-22Paper
Random biochemical networks: the probability of self-sustaining autocatalysis2020-07-16Paper
https://portal.mardi4nfdi.de/entity/Q51111402020-05-26Paper
A Phase Transition in Arrow's Theorem2020-04-27Paper
Gaussian bounds for noise correlation of resilient functions2020-03-04Paper
Broadcasting on Random Directed Acyclic Graphs2020-01-28Paper
Invariance Principle on the Slice2019-12-06Paper
https://portal.mardi4nfdi.de/entity/Q52048242019-12-05Paper
Harmonicity and invariance on slices of the Boolean cube2019-11-07Paper
AND Testing and Robust Judgement Aggregation2019-10-31Paper
Seeded graph matching via large neighborhood statistics2019-10-15Paper
How many subpopulations is too many? Exponential lower bounds for inferring population histories2019-05-21Paper
https://portal.mardi4nfdi.de/entity/Q46338482019-05-06Paper
Regular graphs with linearly many triangles2019-04-03Paper
A proof of the block model threshold conjecture2019-02-01Paper
Strategic Learning and the Topology of Social Networks2019-01-30Paper
[https://portal.mardi4nfdi.de/wiki/Publication:4645045 Product Space Models of Correlation: Between Noise Stability and Additive Combinatorics]2019-01-09Paper
Phylogenetic information complexity: is testing a tree easier than finding it?2018-11-08Paper
Long ties accelerate noisy threshold-based contagions2018-10-08Paper
Reasoning in Bayesian Opinion Exchange Networks Is PSPACE-Hard2018-09-04Paper
Noise stability and correlation with half spaces2018-05-15Paper
Lower Bounds on Same-Set Inner Product in Correlated Spaces2018-04-19Paper
Broadcasting on Bounded Degree DAGs2018-03-20Paper
Non interactive simulation of correlated distributions is decidable2018-03-15Paper
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity2018-02-16Paper
The Vertex Sample Complexity of Free Energy is Polynomial2018-02-16Paper
Distance-based species tree estimation under the coalescent: information-theoretic trade-off between number of loci and sequence length2018-01-04Paper
Coexistence in Preferential Attachment Networks2017-10-10Paper
Invariance principle on the slice2017-10-10Paper
Harmonicity and invariance on slices of the Boolean cube2017-10-10Paper
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model2017-09-21Paper
Distance-based species tree estimation: information-theoretic trade-off between number of loci and sequence length under the coalescent2017-08-31Paper
Competing first passage percolation on random regular graphs2017-08-10Paper
Coalescent-based species tree estimation: a stochastic Farris transform2017-07-13Paper
On Extracting Common Random Bits From Correlated Sources2017-07-12Paper
Opinion exchange dynamics2017-07-11Paper
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters2017-06-08Paper
On Extracting Common Random Bits From Correlated Sources on Large Alphabets2017-05-16Paper
Global and Local Information in Clustering Labeled Block Models2017-04-28Paper
Strong contraction and influences in tail spaces2017-04-12Paper
Global and Local Information in Clustering Labeled Block Models.2017-03-22Paper
Spectral redemption in clustering sparse networks2017-02-16Paper
Noise Stability is computable and low dimensional2017-01-05Paper
A quantitative Gobbard-Satterthwaite theorem without neutrality2016-11-25Paper
Belief propagation, robust reconstruction and optimal recovery of block models2016-11-16Paper
Standard simplices and pluralities are not the most noise stable2016-09-16Paper
Quickest online selection of an increasing subsequence of specified size2016-09-15Paper
Majority rule has transition ratio 4 on Yule trees under a 2-state symmetric model2016-08-19Paper
On the correlation of increasing families2016-08-18Paper
https://portal.mardi4nfdi.de/entity/Q57416312016-07-29Paper
Consistency thresholds for the planted bisection model2016-05-23Paper
Local Algorithms for Block Models with Side Information2016-04-15Paper
Can one hear the shape of a population history?2016-03-02Paper
Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory2016-01-29Paper
Sequence assembly from corrupted shotgun reads2016-01-26Paper
Shotgun assembly of random regular graphs2015-12-28Paper
Explicit Optimal Hardness via Gaussian Stability Results2015-09-24Paper
Reconstruction and estimation in the planted partition model2015-09-14Paper
Density Evolution in the Degree-correlated Stochastic Block Model2015-09-10Paper
Consistency thresholds for the planted bisection model2015-08-21Paper
Robust dimension free isoperimetry in Gaussian space2015-07-06Paper
Shotgun assembly of labeled graphs2015-04-28Paper
Robust optimality of Gaussian noise stability2015-03-27Paper
On the Impossibility of Learning the Missing Mass2015-03-12Paper
Geometric influences. II: Correlation inequalities and noise sensitivity2014-12-05Paper
Optimal phylogenetic reconstruction2014-11-25Paper
Conditional hardness for approximate coloring2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q29217112014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q29217812014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q31915892014-10-06Paper
Mixing under monotone censoring2014-09-29Paper
Majority is stablest2014-08-07Paper
https://portal.mardi4nfdi.de/entity/Q54176462014-05-22Paper
A quantitative gibbard-satterthwaite theorem without neutrality2014-05-13Paper
Asymptotic learning on Bayesian social networks2014-04-25Paper
On the influence of the seed graph in the preferential attachment model2014-01-20Paper
A Smooth Transition from Powerlessness to Absolute Power2014-01-08Paper
Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies2013-11-04Paper
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms2013-07-24Paper
On reverse hypercontractivity2013-06-21Paper
Noise correlation bounds for uniform low degree functions2013-03-27Paper
Scaling limits for width two partially ordered sets: the incomparability window2013-03-20Paper
Exact thresholds for Ising-Gibbs samplers on general graphs2013-03-15Paper
Phylogenetic mixtures: concentration of measure in the large-tree limit2013-01-25Paper
A quantitative Arrow theorem2013-01-14Paper
Complete characterization of functions satisfying the conditions of Arrow's theorem2012-12-28Paper
Maximally stable Gaussian partitions with discrete applications2012-11-13Paper
A note on the entropy/influence conjecture2012-10-26Paper
Exit time tails from pairwise decorrelation in hidden Markov chains, with applications to dynamical percolation2012-10-23Paper
The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem2012-09-17Paper
Geometric influences2012-06-19Paper
VC bounds on the cardinality of nearly orthogonal function classes2012-05-30Paper
The weak limit of Ising models on locally tree-like graphs2012-03-01Paper
On the inference of large phylogenies with long branches: how long is too long?2011-11-04Paper
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep2011-10-27Paper
Sorting and Selection in Posets2011-10-18Paper
Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture2011-09-27Paper
The Computational Complexity of Estimating MCMC Convergence Time2011-08-17Paper
Connectivity and equilibrium in random games2011-07-19Paper
From Agreement to Asymptotic Learning2011-05-24Paper
Approximation resistant predicates from pairwise independence2011-02-18Paper
Submodularity of Influence in Social Networks: From Local to Global2011-01-17Paper
Rapid mixing of Gibbs sampling on graphs that are sparse on average2010-11-09Paper
Truthful Fair Division2010-10-19Paper
Branching Process Approach for 2-Sat Thresholds2010-10-12Paper
Gibbs rapidly samples colorings of \(G(n, d/n)\)2010-09-16Paper
Learning nonsingular phylogenies and hidden Markov models2010-08-16Paper
Learning juntas2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35793952010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35794722010-08-06Paper
Conditional Hardness for Approximate Coloring2010-07-07Paper
Making Consensus Tractable2010-07-04Paper
Noise stability of functions with low influences: invariance and optimality2010-05-27Paper
Iterative maximum likelihood on networks2010-05-21Paper
A Spectral Approach to Analysing Belief Propagation for 3-Colouring2010-04-23Paper
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles2010-04-23Paper
Gaussian bounds for noise correlation of functions2010-03-19Paper
On the hardness of sampling independent sets beyond the tree threshold2009-05-13Paper
https://portal.mardi4nfdi.de/entity/Q35496072009-01-05Paper
A new look at survey propagation and its generalizations2008-12-21Paper
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms2008-11-27Paper
The Complexity of Distinguishing Markov Random Fields2008-11-27Paper
Mixed-up trees: the structure of phylogenetic mixtures2008-09-08Paper
Mafia: A theoretical study of players and coalitions in a partial information environment2008-07-01Paper
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?2008-03-28Paper
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality2008-02-22Paper
Shrinkage Effect in Ancestral Maximum Likelihood2008-02-07Paper
Online Conflict‐Free Coloring for Intervals2007-10-22Paper
Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci2007-10-01Paper
Slow emergence of cooperation for win-stay lose-shift on trees2007-09-20Paper
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems2007-08-28Paper
Learning nonsingular phylogenies and hidden Markov models2007-08-08Paper
Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny2007-08-06Paper
A law of large numbers for weighted majority2007-02-13Paper
On ε‐biased generators in NC02006-09-06Paper
New coins from old: Computing with unknown bias2006-06-27Paper
https://portal.mardi4nfdi.de/entity/Q54716322006-06-14Paper
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels2006-04-17Paper
Learning DNF from random walks2005-10-10Paper
Coin flipping from a cosmic source: On error correction of truly random bits2005-08-29Paper
Glauber dynamics on trees and hyperbolic graphs2005-06-15Paper
Mixing times of the biased card shuffling and the asymmetric exclusion process2005-04-27Paper
https://portal.mardi4nfdi.de/entity/Q46607272005-04-04Paper
Robust reconstruction on trees is determined by the second eigenvalue.2004-12-10Paper
Learning functions of \(k\) relevant variables2004-11-18Paper
A phase transition for a random cluster model on phylogenetic trees.2004-05-27Paper
Shuffling by semi-random transpositions2004-04-23Paper
Distorted metrics on trees and phylogenetic forests2004-03-30Paper
Phase transitions in phylogeny2004-03-29Paper
Information flow on trees2004-03-21Paper
Energy of flows on percolation clusters2004-02-08Paper
On the noise sensitivity of monotone functions2003-10-22Paper
https://portal.mardi4nfdi.de/entity/Q44289282003-09-22Paper
On the mixing time of a simple random walk on the super critical percolation cluster2003-08-14Paper
On the complexity of approximating the VC dimension.2003-05-14Paper
The Minesweeper Game: Percolation and Complexity2003-05-11Paper
Reconstruction on trees: Beating the second eigenvalue2003-05-06Paper
https://portal.mardi4nfdi.de/entity/Q45006892001-05-13Paper
On random graph homomorphisms into \({\mathbb{Z}}\)2000-06-25Paper
Nearest-neighbor walks with low predictability profile and percolation in \(2+\varepsilon\) dimensions2000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q47053201999-12-19Paper
Almost-Linear Planted Cliques Elude the Metropolis Process0001-01-03Paper
When will (game) wars end?N/APaper
Influence Maximization in Ising ModelsN/APaper
Errors are Robustly Tamed in Cumulative Knowledge ProcessesN/APaper
Stable matchings with correlated PreferencesN/APaper
Reconstructing the Geometry of Random Geometric GraphsN/APaper
Finding Super-spreaders in Network CascadesN/APaper
Monotonicity of Recurrence in Random WalksN/APaper
Gaussian Broadcast on GridsN/APaper
Low Degree Hardness for Broadcasting on TreesN/APaper

Research outcomes over time

This page was built for person: Elchanan Mossel