59 citations · 68 across the 3 of their papers we have counts for
5 papers
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 .…
Spectral algorithms for tensor completion
Andrea Montanari, Nike Sun
In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed…
The replica symmetric solution for Potts models on d-regular graphs
Amir Dembo, Andrea Montanari, Allan Sly +1
We provide an explicit formula for the limiting free energy density (log-partition function divided by the number of vertices) for ferromagnetic Potts models on uniformly sparse gr…
The computational hardness of counting in two-spin models on d-regular graphs
Allan Sly, Nike Sun
The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (…