Shortest paths and load scaling in scale-free trees
Bollobás, B
Riordan, O
Physical Review E
volume 69
issue 3
036114
(24 Mar 2004)
doi:10.1103/physreve.69.036114
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
COOPER, C
FRIEZE, A
REED, B
RIORDAN, O
Combinatorics Probability Computing
volume 11
issue 4
323-341
(06 Jul 2002)
doi:10.1017/s0963548302005254
On the Value of a Random Minimum Weight Steiner Tree
Bollobás*, B
Gamarnik, D
Riordan, O
Sudakov†, B
Combinatorica
volume 24
issue 2
187-207
(Apr 2004)
doi:10.1007/s00493-004-0013-z
The threshold for jigsaw percolation on random graphs
Bollobás, B
Riordan, O
Slivken, E
Smith, P
(17 Mar 2015)
doi:10.48550/arxiv.1503.05186
The phase transition in the configuration model
Riordan, O
(04 Apr 2011)
doi:10.48550/arxiv.1104.0613
The evolution of subcritical Achlioptas processes
Riordan, O
Warnke, L
(23 Apr 2012)
doi:10.48550/arxiv.1204.5068
Counting connected hypergraphs via the probabilistic method
Bollobás, B
Riordan, O
(23 Apr 2014)
doi:10.48550/arxiv.1404.5887
On the threshold for rainbow connection number r in random graphs
Heckel, A
Riordan, O
(29 Jul 2013)
doi:10.48550/arxiv.1307.7747
Exploring hypergraphs with martingales
Bollobás, B
Riordan, O
(25 Mar 2014)
doi:10.48550/arxiv.1403.6558
Counting dense connected hypergraphs via the probabilistic method
Bollobás, B
Riordan, O
(15 Nov 2015)
doi:10.48550/arxiv.1511.04739