23 citations · 149 across the 33 of their papers we have counts for
7 papers · 1 filter
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 .…
Archimedes Meets Privacy: On Privately Estimating Quantiles in High Dimensions Under Minimal Assumptions
Omri Ben-Eliezer, Dan Mikulincer, Ilias Zadik
The last few years have seen a surge of work on high dimensional statistics under privacy constraints, mostly following two main lines of work: the ``worst case'' line, which does…
Statistical and Computational Phase Transitions in Group Testing
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +2
We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease within a population of size n, based on the outcomes of poo…
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins +3
Many high-dimensional statistical inference problems are believed to possess inherent computational hardness. Various frameworks have been proposed to give rigorous evidence for su…
Almost-Linear Planted Cliques Elude the Metropolis Process
Zongchen Chen, Elchanan Mossel, Ilias Zadik
A seminal work of Jerrum (1992) showed that large cliques elude the Metropolis process. More specifically, Jerrum showed that the Metropolis algorithm cannot find a clique of size…