Nike Sun

According to our database, Nike Sun authored at least 14 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Sharp threshold sequence and universality for Ising perceptron models.

Shuta Nakajima, Nike Sun

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Sharp thresholds in inference of planted subgraphs.

Elchanan Mossel, Jonathan Niles-Weed, Youngtak Sohn, Nike Sun, Ilias Zadik

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

A second moment proof of the spread lemma.

Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik

CoRR, 2022

On the Second Kahn-Kalai Conjecture.

Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, Ilias Zadik

CoRR, 2022

Gardner formula for Ising perceptron models at small densities.

Erwin Bolthausen, Shuta Nakajima, Nike Sun, Changji Xu

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Statistical physics of random CSPs (tutorial).

Nike Sun

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2019

Capacity lower bound for the Ising perceptron.

Jian Ding, Nike Sun

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Breaking of 1RSB in Random Regular MAX-NAE-SAT.

Zsolt Bartha, Nike Sun, Yumeng Zhang

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2016

Spectral algorithms for tensor completion.

Andrea Montanari, Nike Sun

CoRR, 2016

The Number of Solutions for Random Regular NAE-SAT.

Allan Sly, Nike Sun, Yumeng Zhang

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Proof of the Satisfiability Conjecture for Large k.

Jian Ding, Allan Sly, Nike Sun

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014

Satisfiability threshold for random regular NAE-SAT.

Jian Ding, Allan Sly, Nike Sun

Proceedings of the Symposium on Theory of Computing, 2014

2012

The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs.

Allan Sly, Nike Sun

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Factor models on locally tree-like graphs

Amir Dembo, Andrea Montanari, Nike Sun

CoRR, 2011