Spectral redemption in clustering sparse networks F Krzakala, C Moore, E Mossel, J Neeman, A Sly, L Zdeborová, P Zhang Proceedings of the National Academy of Sciences 110 (52), 20935-20940, 2013 | 734 | 2013 |
Reconstruction and estimation in the planted partition model E Mossel, J Neeman, A Sly Probability Theory and Related Fields 162, 431-461, 2015 | 620* | 2015 |
A proof of the block model threshold conjecture E Mossel, J Neeman, A Sly Combinatorica 38 (3), 665-708, 2018 | 392 | 2018 |
Random graphs with a given degree sequence S Chatterjee, P Diaconis, A Sly | 330 | 2011 |
Consistency thresholds for binary symmetric block models E Mossel, J Neeman, A Sly arXiv preprint arXiv:1407.1591 3 (5), 2014 | 294* | 2014 |
The computational hardness of counting in two-spin models on d-regular graphs A Sly, N Sun 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 361-369, 2012 | 266* | 2012 |
Computational transition at the uniqueness threshold A Sly 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 287-296, 2010 | 249 | 2010 |
Proof of the satisfiability conjecture for large k J Ding, A Sly, N Sun Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 236 | 2015 |
Mixing time of exponential random graphs S Bhamidi, G Bresler, A Sly 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 803-812, 2008 | 207 | 2008 |
Reconstruction of Markov random fields from samples: Some observations and algorithms G Bresler, E Mossel, A Sly Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008 | 179* | 2008 |
Strategic learning and the topology of social networks E Mossel, A Sly, O Tamuz Econometrica 83 (5), 1755-1794, 2015 | 147 | 2015 |
Cutoff phenomena for random walks on random regular graphs E Lubetzky, A Sly | 141 | 2010 |
Belief propagation, robust reconstruction and optimal recovery of block models E Mossel, J Neeman, A Sly Conference on Learning Theory, 356-370, 2014 | 119 | 2014 |
Reconstruction for the Potts model A Sly Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 104 | 2009 |
Exact thresholds for Ising–Gibbs samplers on general graphs E Mossel, A Sly | 102 | 2013 |
Last passage percolation with a defect line and the solution of the slow bond problem R Basu, V Sidoravicius, A Sly arXiv preprint arXiv:1408.3464, 2014 | 99 | 2014 |
Asymptotic learning on bayesian social networks E Mossel, A Sly, O Tamuz Probability Theory and Related Fields 158 (1), 127-157, 2014 | 92 | 2014 |
Belief propagation, robust reconstruction and optimal recovery of block models E Mossel, J Neeman, A Sly | 87 | 2016 |
Critical Ising on the square lattice mixes in polynomial time E Lubetzky, A Sly Communications in Mathematical Physics 313 (3), 815-836, 2012 | 84 | 2012 |
Satisfiability threshold for random regular NAE-SAT J Ding, A Sly, N Sun Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 82 | 2014 |