23 citations · 149 across the 33 of their papers we have counts for
36 papers
A dimension-free bound for isoperimetry of unconditional log-concave measures
Dan Mikulincer, Ilias Zadik
We prove a dimension-free Poincaré inequality for isotropic unconditional log-concave probability measures, establishing the Kannan-Lovász-Simonovits (KLS) conjecture in the uncond…
A Bayesian Proof of the Bernoulli Theorem
Jingbo Liu, Ilias Zadik
We give a new proof of the Bernoulli theorem, conjectured by Talagrand and proved in the seminal work of Bednorz and Latała. Our approach is based on information-theoretic ideas: l…
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
David Gamarnik, Elchanan Mossel, Ilias Zadik
We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough thre…
Sharp thresholds in inference of planted subgraphs
Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn +2
A major question in the study of the Erdős--Rényi random graph is to understand the probability that it contains a given subgraph. This study originated in classical work of Erdős…
A second moment proof of the spread lemma
Elchanan Mossel, Jonathan Niles-Weed, Nike Sun +1
This note concerns a well-known result which we term the ``spread lemma,'' which establishes the existence (with high probability) of a desired structure in a random set. The sprea…
On the Second Kahn--Kalai Conjecture
Elchanan Mossel, Jonathan Niles-Weed, Nike Sun +1
For any given graph , we are interested in , the minimal such that the Erdős-Rényi graph contains a copy of with probability at least .…