Allan Sly

According to our database, Allan Sly authored at least 33 papers between 2007 and 2024.

Collaborative distances:

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

2024

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs.

Elchanan Mossel, Allan Sly, Youngtak Sohn

CoRR, 2024

Local Geometry of NAE-SAT Solutions in the Condensation Regime.

Allan Sly, Youngtak Sohn

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees.

Elchanan Mossel, Allan Sly, Youngtak Sohn

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster.

Emmanuel Abbe, Shuangping Li, Allan Sly

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

One-step replica symmetry breaking of random regular NAE-SAT II.

Danny Nam, Allan Sly, Youngtak Sohn

CoRR, 2021

One-step replica symmetry breaking of random regular NAE-SAT.

Danny Nam, Allan Sly, Youngtak Sohn

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron.

Emmanuel Abbe, Shuangping Li, Allan Sly

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Optimal Recovery of Block Models with $q$ Communities.

Byron Chin, Allan Sly

CoRR, 2020

Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold.

Emmanuel Abbe, Shuangping Li, Allan Sly

CoRR, 2020

2019

Rapid mixing of hypergraph independent sets.

Jonathan Hermon, Allan Sly, Yumeng Zhang

Random Struct. Algorithms, 2019

2018

A Proof of the Block Model Threshold Conjecture.

Elchanan Mossel, Joe Neeman, Allan Sly

Comb., 2018

Social Learning Equilibria.

Elchanan Mossel, Manuel Mueller-Frank, Allan Sly, Omer Tamuz

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017

How fragile are information cascades?

Yuval Peres, Miklós Z. Rácz, Allan Sly, Izabella Stuhl

CoRR, 2017

Group Synchronization on Grids.

Emmanuel Abbe, Laurent Massoulié, Andrea Montanari, Allan Sly, Nikhil Srivastava

CoRR, 2017

2016

Rapid Mixing of Hypergraph Independent Set.

Jonathan Hermon, Allan Sly, Yumeng Zhang

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

Consistency Thresholds for the Planted Bisection Model.

Elchanan Mossel, Joe Neeman, Allan Sly

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 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

Consistency Thresholds for Binary Symmetric Block Models.

Elchanan Mossel, Joe Neeman, Allan Sly

CoRR, 2014

Satisfiability threshold for random regular NAE-SAT.

Jian Ding, Allan Sly, Nike Sun

Proceedings of the Symposium on Theory of Computing, 2014

Belief propagation, robust reconstruction and optimal recovery of block models.

Elchanan Mossel, Joe Neeman, Allan Sly

Proceedings of The 27th Conference on Learning Theory, 2014

2013

Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters.

Elchanan Mossel, Sébastien Roch, Allan Sly

IEEE Trans. Inf. Theory, 2013

Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms.

Guy Bresler, Elchanan Mossel, Allan Sly

SIAM J. Comput., 2013

Spectral redemption: clustering sparse networks.

Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, Pan Zhang

CoRR, 2013

2012

Strategic Learning and the Topology of Social Networks

Elchanan Mossel, Allan Sly, Omer Tamuz

CoRR, 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

2010

On the inference of large phylogenies with long branches: How long is too long?

Elchanan Mossel, Sebastien Roch, Allan Sly

CoRR, 2010

Computational Transition at the Uniqueness Threshold.

Allan Sly

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Reconstruction Threshold for the Hardcore Model.

Nayantara Bhatnagar, Allan Sly, Prasad Tetali

Proceedings of the Approximation, 2010

2009

Rapid mixing of Gibbs sampling on graphs that are sparse on average.

Elchanan Mossel, Allan Sly

Random Struct. Algorithms, 2009

Reconstruction for the Potts model.

Allan Sly

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Mixing Time of Exponential Random Graphs.

Shankar Bhamidi, Guy Bresler, Allan Sly

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms

Guy Bresler, Elchanan Mossel, Allan Sly

CoRR, 2007