Oliver Riordan

Statistical and Nonlinear Physics · 2001–2007

A researcher in the Science corpus: 12 papers; trusts 46 researchers and is trusted by 55 researchers here, as inferred from the citation graph.

Subfields

• Statistical and Nonlinear Physics — 54 citations into it; #722 of 10,127 by trust here, #883 by citations
• Geometry and Topology — 30 citations into it; #780 of 7,422 by trust here, #850 by citations
• Computational Theory and Mathematics — 26 citations into it; #1,135 of 12,182 by trust here, #1,500 by citations
• Discrete Mathematics and Combinatorics — 22 citations into it; #232 of 2,017 by trust here, #122 by citations
• Algorithms & Complexity — 19 citations into it
• Computer Networks and Communications — 12 citations into it
• Mathematical Physics — 11 citations into it; #544 of 8,562 by trust here, #384 by citations
• Information Systems — 9 citations into it

Whom Oliver Riordan trusts overall

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

1. Béla Bollobás
2. Albert-László Barabási
3. Réka Albert
4. Mark Newman
5. Duncan J. Watts
6. Steven H. Strogatz
7. Christian Borgs
8. L. Lov'asz
9. Sergey N. Dorogovtsev
10. Svante Janson

Who trusts Oliver Riordan overall

1. Remco van der Hofstad
2. Béla Bollobás
3. Sourav Chatterjee
4. Johan Wästlund
5. Christian Borgs
6. B. Graham
7. Alan M. Frieze
8. Vincent Tassion
9. Vasco M. Carvalho
10. Oded Schramm

Papers from Oliver Riordan's perspective

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

1. Graph structure in the Web (Comput. Networks)
2. Emergence of Scaling in Random Networks
3. Random graphs with arbitrary degree distributions and their applications. (Physical review. E, Statistical, nonlinear, and soft matter physics)
4. The structure of scientific collaboration networks.
5. The large-scale organization of metabolic networks (Nature)
6. Statistical mechanics of complex networks
7. Emergence of scaling in random networks
8. Breakdown of the internet under intentional attack. (Physical Review Letters)
9. Stochastic models for the Web graph (Proceedings 41st Annual Symposium on Foundations of Computer Science)
10. Scale-free characteristics of random networks: the topology of the world-wide web

Their papers

• Mathematical results on scale‐free random graphs (2005) — 548 citations
• The phase transition in inhomogeneous random graphs (2005) — 844 citations
• Metrics for sparse graphs (2007) — 100 citations
• Percolation on dense graph sequences. (2007) — 93 citations
• The critical probability for random Voronoi percolation in the plane is 1/2 (2004) — 178 citations
• A Short Proof of the Harris–Kesten Theorem (2004) — 75 citations
• The Diameter of a Scale-Free Random Graph (2004) — 657 citations
• Robustness and Vulnerability of Scale-Free Random Graphs (2004) — 319 citations
• Directed scale-free graphs (2003) — 440 citations
• A polynomial of graphs on surfaces (2002) — 177 citations
• A Polynomial Invariant of Graphs On Orientable Surfaces (2001) — 118 citations
• The degree sequence of a scale‐free random graph process (2001) — 830 citations