Allan Sly

Statistical and Nonlinear Physics · 2008–2015

A researcher in the Science corpus: 6 papers; trusts 38 researchers and is trusted by 18 researchers here, as inferred from the citation graph.

Subfields

• Statistical and Nonlinear Physics — 33 citations into it; #4,410 of 10,127 by trust here, #2,849 by citations
• Geometry and Topology — 22 citations into it; #2,526 of 7,422 by trust here, #2,107 by citations
• Statistics and Probability — 22 citations into it; #5,039 of 12,932 by trust here, #8,279 by citations
• Computational Theory and Mathematics — 20 citations into it; #5,423 of 12,182 by trust here, #5,724 by citations
• Mathematical Physics — 20 citations into it; #3,338 of 8,562 by trust here, #5,088 by citations
• Discrete Mathematics and Combinatorics — 13 citations into it; #287 of 2,017 by trust here, #259 by citations
• Artificial Intelligence — 9 citations into it; #33,727 of 35,345 by trust here, #18,186 by citations
• Algorithms & Complexity — 8 citations into it

Whom Allan Sly trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Alan M. Frieze
2. Joel Friedman
3. Mark Newman
4. Frank McSherry
5. Aurelien Decelle
6. Persi Diaconis
7. L. Lov'asz
8. Christian Borgs
9. Omer Reingold
10. Paul Holland

Who trusts Allan Sly overall

1. Charles Bordenave
2. Eyal Lubetzky
3. Justin Salez
4. Emmanuel Abbe
5. Sourav Chatterjee
6. Lenka Zdeborov'a
7. Yuval Peres
8. Pietro Caputo
9. Persi Diaconis
10. Joseph K. Blitzstein

Papers from Allan Sly's perspective

Ordered by how strongly the researchers Allan Sly trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Structure and Function of Complex Networks
2. On the evolution of random graphs
3. Spectral partitioning of random graphs (Proceedings IEEE International Conference on Cluster Computing)
4. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper
5. Graph limits and exchangeable random graphs
6. The Probabilistic Method
7. Exploring complex networks (Nature)
8. Normalized cuts and image segmentation
9. Finding community structure in networks using the eigenvectors of matrices. (Physical review. E, Statistical, nonlinear, and soft matter physics)
10. Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics

Their papers

• A Proof of the Block Model Threshold Conjecture (2013) — 356 citations
• Cutoff phenomena for random walks on random regular graphs (2008) — 132 citations
• Random walks on the random graph (2015) — 64 citations
• Spectral redemption in clustering sparse networks (2013) — 660 citations
• Reconstruction and estimation in the planted partition model (2012) — 388 citations
• Random graphs with a given degree sequence (2010) — 392 citations