O. Riordan

Most-cited papers

The phase transition in inhomogeneous random graphs
B. Bollobás, S. Janson, O. Riordan
2005Random Struct. Algorithms855 citations Open access
Semantic Scholar
The Diameter of a Scale-Free Random Graph
B. Bollobás, O. Riordan
2004Comb.660 citations
Semantic Scholar
Mathematical results on scale‐free random graphs
B. Bollobás, O. Riordan
2005549 citations
Semantic Scholar
Directed scale-free graphs
B. Bollobás, C. Borgs, J. Chayes, O. Riordan
2003ACM-SIAM Symposium on Discrete Algorithms450 citations
Semantic Scholar
Robustness and Vulnerability of Scale-Free Random Graphs
B. Bollobás, O. Riordan
2004Internet Mathematics325 citations Open access
Semantic Scholar
Explosive Percolation Is Continuous
O. Riordan, L. Warnke
2011Science236 citations
Semantic Scholar
The critical probability for random Voronoi percolation in the plane is 1/2
B. Bollobás, O. Riordan
2004179 citations Open access
Semantic Scholar
A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
B. Bollobás, S. Janson, O. Riordan
2005118 citations
Semantic Scholar
Metrics for sparse graphs
B. Bollobás, O. Riordan
2007102 citations Open access
Semantic Scholar
Sparse graphs: Metrics and random models
B. Bollobás, O. Riordan
2008Random Struct. Algorithms101 citations
Semantic Scholar
Percolation on dense graph sequences.
B. Bollobás, C. Borgs, J. Chayes, O. Riordan
200794 citations Open access
Semantic Scholar
The Phase Transition in the Configuration Model
O. Riordan
2011Combinatorics, probability & computing87 citations Open access
Semantic Scholar
The consequences of Zipf's law for syntax and symbolic reference
R. F. Cancho, O. Riordan, B. Bollobás
2005Proceedings of the Royal Society of London. Biological Sciences87 citations Open access
Semantic Scholar
Achlioptas process phase transitions are continuous
O. Riordan, L. Warnke
201183 citations Open access
Semantic Scholar
A Short Proof of the Harris–Kesten Theorem
B. Bollobás, O. Riordan
200477 citations Open access
Semantic Scholar
Degree distribution of the FKP network model
Noam Berger, B. Bollobás, C. Borgs, J. Chayes +1 more
2003Theoretical Computer Science70 citations Open access
Semantic Scholar
Linear algebra and bootstrap percolation
J. Balogh, B. Bollobás, R. Morris, O. Riordan
2011Journal of Combinatorial Theory67 citations Open access
Semantic Scholar
Sparse random graphs with clustering
B. Bollobás, S. Janson, O. Riordan
2008Random Struct. Algorithms65 citations Open access
Semantic Scholar
The k-Core and Branching Processes
O. Riordan
2005Combinatorics, probability & computing64 citations Open access
Semantic Scholar
Vertex‐distinguishing edge colorings of graphs
P. Balister, O. Riordan, R. Schelp
2003Journal of Graph Theory64 citations
Semantic Scholar
Coupling Scale-Free and Classical Random Graphs
B. Bollobás, O. Riordan
2004Internet Mathematics55 citations Open access
Semantic Scholar
An old approach to the giant component problem
B. Bollobás, O. Riordan
2012J. Comb. Theory B50 citations Open access
Semantic Scholar
The inefficiency of re-weighted sampling and the curse of system size in high-order path integration
Michele Ceriotti, Guy A. R. Brain, O. Riordan, D. Manolopoulos
2011Proceedings of the Royal Society A49 citations Open access
Semantic Scholar
Random Graphs and Branching Processes
B. Bollobás, O. Riordan
200845 citations
Semantic Scholar
The phase transition in the uniformly grown random graph has infinite order
B. Bollobás, S. Janson, O. Riordan
2005Random Struct. Algorithms45 citations Open access
Semantic Scholar
Asymptotic normality of the size of the giant component via a random walk
B. Bollobás, O. Riordan
2010J. Comb. Theory B43 citations Open access
Semantic Scholar
The Small Giant Component in Scale-Free Random Graphs
O. Riordan
2005Combinatorics, probability & computing38 citations
Semantic Scholar
Combinatorics, Probability and Computing
Michael Krivelevich, R. Morris, O. Riordan, A. Steger
2020Oberwolfach Reports37 citations
Semantic Scholar
On the Value of a Random Minimum Weight Steiner Tree
B. Bollobás, D. Gamarnik, O. Riordan, B. Sudakov
2004Comb.37 citations
Semantic Scholar
Essential enhancements revisited
P. Balister, B. Bollobás, O. Riordan
201436 citations
Semantic Scholar
Percolation on Self-Dual Polygon Configurations
B. Bollobás, O. Riordan
201034 citations Open access
Semantic Scholar
On covering by translates of a set
B. Bollobás, S. Janson, O. Riordan
2009Random Struct. Algorithms34 citations Open access
Semantic Scholar
The diameter game
B. Bollobás, O. Riordan
200933 citations
Semantic Scholar
Achlioptas processes are not always self-averaging.
O. Riordan, L. Warnke
2011Physical review. E, Statistical, nonlinear, and soft matter physics32 citations Open access
Semantic Scholar
Asymptotic normality of the size of the giant component in a random hypergraph
B. Bollobás, O. Riordan
2011Random Struct. Algorithms31 citations Open access
Semantic Scholar
Clique percolation
B. Bollobás, O. Riordan
2008Random Struct. Algorithms31 citations Open access
Semantic Scholar
Rigorous confidence intervals for critical probabilities.
O. Riordan, M. Walters
2007Physical review. E, Statistical, nonlinear, and soft matter physics31 citations Open access
Semantic Scholar
The Cut Metric, Random Graphs, and Branching Processes
B. Bollobás, S. Janson, O. Riordan
200930 citations Open access
Semantic Scholar
The Janson inequalities for general up‐sets
O. Riordan, L. Warnke
2012Random Struct. Algorithms29 citations Open access
Semantic Scholar
Scale-Free Cortical Planar Networks
W. Freeman, R. Kozma, B. Bollobá, O. Riordan
200828 citations Open access
Semantic Scholar
Random cliques in random graphs and sharp thresholds for F$$ F $$ ‐factors
O. Riordan
2018Random Struct. Algorithms26 citations
Semantic Scholar
Sharp thresholds and percolation in the plane
B. Bollobás, O. Riordan
2004Random Struct. Algorithms25 citations Open access
Semantic Scholar
Graphs with large maximum degree containing no odd cycles of a given length
P. Balister, B. Bollobás, O. Riordan, R. Schelp
2003J. Comb. Theory B25 citations Open access
Semantic Scholar
A Simple Branching Process Approach to the Phase Transition in Gn, p
B. Bollobás, O. Riordan
2012Electronic Journal of Combinatorics24 citations Open access
Semantic Scholar
Percolation on random Johnson–Mehl tessellations and related models
B. Bollobás, O. Riordan
200624 citations Open access
Semantic Scholar
Slow emergence of the giant component in the growing m‐out graph
B. Bollobás, O. Riordan
2005Random Struct. Algorithms24 citations
Semantic Scholar
Shortest paths and load scaling in scale-free trees.
B. Bollobás, O. Riordan
2004Physical review. E, Statistical, nonlinear, and soft matter physics22 citations
Semantic Scholar
Introduction
P. Balister, B. Bollobás, I. Leader, R. Morris +1 more
2018Combinatorics, probability & computing21 citations
Semantic Scholar
Long cycles in random subgraphs of graphs with large minimum degree
O. Riordan
2013Random Struct. Algorithms21 citations Open access
Semantic Scholar
The evolution of subcritical Achlioptas processes
O. Riordan, L. Warnke
2012Random Struct. Algorithms21 citations Open access
Semantic Scholar