261 citations · 347 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
It was "all" for "nothing": sharp phase transitions for noiseless discrete channels
Jonathan Niles-Weed, Ilias Zadik
We establish a phase transition known as the "all-or-nothing" phenomenon for noiseless discrete channels. This class of models includes the Bernoulli group testing model and the pl…
The All-or-Nothing Phenomenon in Sparse Tensor PCA
Jonathan Niles-Weed, Ilias Zadik
We study the statistical problem of estimating a rank-one sparse tensor corrupted by additive Gaussian noise, a model also known as sparse tensor PCA. We show that for Bernoulli an…
Estimation under group actions: recovering orbits from invariants
Afonso S. Bandeira, Ben Blum-Smith, Joe Kileel +3
We study a class of orbit recovery problems in which we observe independent copies of an unknown element of , each linearly acted upon by a random element of some gro…