Allan Sly - Concepedia

Author

Allan Sly

University of California, Berkeley ORCID

Also Known As

A. Sly, Allan Sly, Sly, Allan, Toninelli, Fabio Lucio

191

Publications

Citations

H-Index

Concepts

All Affiliations

University of California, Berkeley Princeton University Stanford University Microsoft (United States)Australian National University

About

Allan Sly is an author at University of California, Berkeley specializing in engineering, probability theory, and graph theory.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	24	39	1.8K
2	Education	5	5	285
3	Natural Sciences	3	3	81
4	Business	2	2	155
5	Language Studies	1	1	14

Allan Sly

Publications

3.6K

Citations

H-Index

Page 1

	Year	Citations
Spectral redemption in clustering sparse networks Florent Krząkała, Cristopher Moore, Elchanan Mossel, Proceedings of the National Academy of Sciences	2013	637
Reconstruction and estimation in the planted partition model Elchanan Mossel, Allan Sly Probability Theory and Related Fields Parameter EstimationDensity EstimationEngineeringStatistical InferenceEstimation Theory	2014	302
A Proof of the Block Model Threshold Conjecture Elchanan Mossel, Joe Neeman, Allan Sly COMBINATORICA Mathematical ProgrammingBlock DesignLower BoundExtremal Set TheoryDiscrete Mathematics	2017	158
Stochastic Block Models and Reconstruction Elchanan Mossel, Joe Neeman, Allan Sly arXiv (Cornell University)	2012	142
Mixing time of exponential random graphs Shankar Bhamidi, Guy Bresler, Allan Sly The Annals of Applied Probability Network Theory (Electrical Engineering)EngineeringExponential Random GraphsNetwork AnalysisNetwork Model	2011	103
Counting in two-spin models on d-regular graphs Allan Sly, Nike Sun The Annals of Probability	2014	101
Consistency Thresholds for the Planted Bisection Model Elchanan Mossel, Joe Neeman, Allan Sly Mathematical ProgrammingPlanted BisectionEngineeringCommunity MiningNetwork Analysis	2015	101
Cutoff phenomena for random walks on random regular graphs Eyal Lubetzky, Allan Sly Duke Mathematical Journal	2010	100
The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs Allan Sly, Nike Sun EngineeringSpin SystemsComputational ComplexityMathematical Statistical PhysicStatistical Field Theory	2012	88
Proof of the Satisfiability Conjecture for Large k Jian Ding, Allan Sly, Nike Sun EngineeringAutomated ReasoningProof ComplexityRandom K-sat FormulaLower Bound	2015	87

Page 1