Gerard Hooghiemstra

Statistical and Nonlinear Physics · 2001–2012

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

Subfields

• Statistical and Nonlinear Physics — 46 citations into it; #3,786 of 10,127 by trust here, #3,979 by citations
• Computational Theory and Mathematics — 22 citations into it
• Mathematical Physics — 22 citations into it; #3,525 of 8,562 by trust here, #2,387 by citations
• Geometry and Topology — 13 citations into it; #6,380 of 7,422 by trust here, #3,959 by citations
• Discrete Mathematics and Combinatorics — 12 citations into it; #1,824 of 2,017 by trust here, #1,051 by citations
• Condensed Matter Physics — 9 citations into it; #982 of 1,948 by trust here, #1,770 by citations
• Algorithms & Complexity — 7 citations into it
• Scaling & Learning Theory — 6 citations into it

Whom Gerard Hooghiemstra trusts overall

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

1. Béla Bollobás
2. Svante Janson
3. R. Durrett
4. Remco van der Hofstad
5. Mark Newman
6. Fan Chung
7. Oliver Riordan
8. Réka Albert
9. Linyuan Lu
10. Harry Kesten

Who trusts Gerard Hooghiemstra overall

1. Remco van der Hofstad
2. Grant Robert Schoenebeck
3. Shankar Bhamidi

Papers from Gerard Hooghiemstra's perspective

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

1. Statistical mechanics of complex networks
2. The average distances in random graphs with given expected degrees
3. A Random Graph Model for Power Law Graphs (Experimental Mathematics)
4. Emergence of scaling in random networks
5. Random graphs (Wiley-Interscience series in discrete mathematics and optimization)
6. The Structure and Function of Complex Networks
7. The Diameter of a Scale-Free Random Graph (Comb.)
8. The phase transition in inhomogeneous random graphs (Random Struct. Algorithms)
9. The degree sequence of a scale‐free random graph process (Random Struct. Algorithms)
10. Small worlds: the dynamics of networks between order and randomness

Their papers

• Universality for first passage percolation on sparse random graphs (2012) — 66 citations
• Scale-free percolation (2011) — 111 citations
• First passage percolation on random graphs with finite mean degrees (2009) — 98 citations
• Distances in Random Graphs with Finite Mean and Infinite Variance Degrees (2005) — 120 citations
• Distances in random graphs with infinite mean degrees (2004) — 62 citations
• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH (2001) — 69 citations