Allan Sly

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 20

Top Topics

Symmetry Breaking

Phase Transition

Propositional Satisfiability

Top Venues

Publications

Allan Sly, Youngtak Sohn
Local Geometry of NAE-SAT Solutions in the Condensation Regime. STOC (2024)
Elchanan Mossel, Allan Sly, Youngtak Sohn
Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs. CoRR (2024)
Elchanan Mossel, Allan Sly, Youngtak Sohn
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. STOC (2023)
Allan Sly, Youngtak Sohn
Local geometry of NAE-SAT solutions in the condensation regime. CoRR (2023)
Emmanuel Abbe, Shuangping Li, Allan Sly
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster. STOC (2022)
Emmanuel Abbe, Shuangping Li, Allan Sly
Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron. FOCS (2022)
Danny Nam, Allan Sly, Youngtak Sohn
One-step replica symmetry breaking of random regular NAE-SAT. FOCS (2022)
Elchanan Mossel, Allan Sly, Youngtak Sohn
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. CoRR (2022)
Emmanuel Abbe, Shuangping Li, Allan Sly
Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron. FOCS (2021)
Danny Nam, Allan Sly, Youngtak Sohn
One-step replica symmetry breaking of random regular NAE-SAT II. CoRR (2021)
Danny Nam, Allan Sly, Youngtak Sohn
One-step replica symmetry breaking of random regular NAE-SAT. FOCS (2021)
Emmanuel Abbe, Shuangping Li, Allan Sly
Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold. CoRR (2020)
Byron Chin, Allan Sly
Optimal Recovery of Block Models with $q$ Communities. CoRR (2020)
Jonathan Hermon, Allan Sly, Yumeng Zhang
Rapid mixing of hypergraph independent sets. Random Struct. Algorithms 54 (4) (2019)
Elchanan Mossel, Manuel Mueller-Frank, Allan Sly, Omer Tamuz
Social Learning Equilibria. EC (2018)
Elchanan Mossel, Joe Neeman, Allan Sly
A Proof of the Block Model Threshold Conjecture. Comb. 38 (3) (2018)
Yuval Peres, Miklós Z. Rácz, Allan Sly, Izabella Stuhl
How fragile are information cascades? CoRR (2017)
Emmanuel Abbe, Laurent Massoulié, Andrea Montanari, Allan Sly, Nikhil Srivastava
Group Synchronization on Grids. CoRR (2017)
Jonathan Hermon, Allan Sly, Yumeng Zhang
Rapid Mixing of Hypergraph Independent Set. CoRR (2016)
Allan Sly, Nike Sun, Yumeng Zhang
The Number of Solutions for Random Regular NAE-SAT. FOCS (2016)
Elchanan Mossel, Joe Neeman, Allan Sly
Consistency Thresholds for the Planted Bisection Model. STOC (2015)
Jian Ding, Allan Sly, Nike Sun
Proof of the Satisfiability Conjecture for Large k. STOC (2015)
Elchanan Mossel, Joe Neeman, Allan Sly
Belief propagation, robust reconstruction and optimal recovery of block models. COLT (2014)
Jian Ding, Allan Sly, Nike Sun
Satisfiability threshold for random regular NAE-SAT. STOC (2014)
Jian Ding, Allan Sly, Nike Sun
Proof of the satisfiability conjecture for large k. CoRR (2014)
Elchanan Mossel, Joe Neeman, Allan Sly
Consistency Thresholds for Binary Symmetric Block Models. CoRR (2014)
Elchanan Mossel, Sébastien Roch, Allan Sly
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters. IEEE Trans. Inf. Theory 59 (7) (2013)
Elchanan Mossel, Joe Neeman, Allan Sly
Belief Propagation, Robust Reconstruction, and Optimal Recovery of Block Models. CoRR (2013)
Elchanan Mossel, Joe Neeman, Allan Sly
A Proof Of The Block Model Threshold Conjecture. CoRR (2013)
Guy Bresler, Elchanan Mossel, Allan Sly
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. SIAM J. Comput. 42 (2) (2013)
Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, Pan Zhang
Spectral redemption: clustering sparse networks. CoRR (2013)
Allan Sly, Nike Sun
The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs. FOCS (2012)
Elchanan Mossel, Allan Sly, Omer Tamuz
Strategic Learning and the Topology of Social Networks CoRR (2012)
Allan Sly, Nike Sun
The computational hardness of counting in two-spin models on d-regular graphs CoRR (2012)
Elchanan Mossel, Sébastien Roch, Allan Sly
Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters CoRR (2011)
Nayantara Bhatnagar, Allan Sly, Prasad Tetali
Reconstruction Threshold for the Hardcore Model CoRR (2010)
Elchanan Mossel, Sebastien Roch, Allan Sly
On the inference of large phylogenies with long branches: How long is too long? CoRR (2010)
Allan Sly
Computational Transition at the Uniqueness Threshold CoRR (2010)
Nayantara Bhatnagar, Allan Sly, Prasad Tetali
Reconstruction Threshold for the Hardcore Model. APPROX-RANDOM (2010)
Allan Sly
Computational Transition at the Uniqueness Threshold. FOCS (2010)
Elchanan Mossel, Allan Sly
Rapid mixing of Gibbs sampling on graphs that are sparse on average. Random Struct. Algorithms 35 (2) (2009)
Allan Sly
Reconstruction for the Potts model. STOC (2009)
Elchanan Mossel, Allan Sly
Rapid mixing of Gibbs sampling on graphs that are sparse on average. SODA (2008)
Shankar Bhamidi, Guy Bresler, Allan Sly
Mixing Time of Exponential Random Graphs. FOCS (2008)
Guy Bresler, Elchanan Mossel, Allan Sly
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. APPROX-RANDOM (2008)
Guy Bresler, Elchanan Mossel, Allan Sly
Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms CoRR (2007)