Joel H. Spencer

Random Struct. Algorithms · 2001–2009

A researcher in the Science corpus: 8 papers; trusts 2 researchers and is trusted by 16 researchers here, as inferred from the citation graph.

Whom Joel H. Spencer trusts overall

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

1. Nicholas I. Fisher

Who trusts Joel H. Spencer overall

1. Johan Wästlund
2. Remco van der Hofstad
3. Laurent Eschenauer
4. Noga Alon
5. Yun Zhou
6. Béla Bollobás
7. Martin Haenggi
8. Svante Janson
9. Michael Krivelevich
10. Raissa M. D’Souza

Papers from Joel H. Spencer's perspective

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

1. Emergence of Scaling in Random Networks
2. Probability Inequalities for Sums of Bounded Random Variables
3. Scale-free characteristics of random networks: the topology of the world-wide web
4. Stochastic models for the Web graph (Proceedings 41st Annual Symposium on Foundations of Computer Science)
5. The Probabilistic Method
6. Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
7. THE SELF-AVOIDING WALK
8. Graph structure in the Web (Comput. Networks)
9. The Anatomy of a Large-Scale Hypertextual Web Search Engine
10. Authoritative sources in a hyperlinked environment

Their papers

• Random subgraphs of finite graphs : II. The lace expansion and the triangle condition (2004) — 107 citations
• The Probabilistic Method, Second Edition (2004) — 850 citations
• The Strange Logic of Random Graphs (2001) — 328 citations
• The Elementary Proof of the Prime Number Theorem (2009) — 121 citations
• Explosive Percolation in Random Networks (2009) — 551 citations
• The Probabilistic Method: Alon/Probabilistic (2008) — 452 citations
• Wiley‐Interscience Series in Discrete Mathematics and Optimization (2004) — 78 citations
• The degree sequence of a scale‐free random graph process (2001) — 830 citations