A simple branching process approach to the phase transition in $G_{n,p}$
Bollobas, B
Riordan, O
(26 Jul 2012)
doi:10.48550/arxiv.1207.6209
Sparse random graphs with clustering
Bollobas, B
Janson, S
Riordan, O
(13 Jul 2008)
doi:10.48550/arxiv.0807.2040
Susceptibility in inhomogeneous random graphs
Janson, S
Riordan, O
(04 May 2009)
doi:10.48550/arxiv.0905.0437
Asymptotic normality of the size of the giant component in a random hypergraph
Bollobas, B
Riordan, O
(15 Dec 2011)
doi:10.48550/arxiv.1112.3615
An old approach to the giant component problem
Bollobas, B
Riordan, O
(17 Sep 2012)
doi:10.48550/arxiv.1209.3691
Sparse graphs: metrics and random models
Bollobas, B
Riordan, O
(14 Dec 2008)
doi:10.48550/arxiv.0812.2656
Duality in inhomogeneous random graphs, and the cut metric
Janson, S
Riordan, O
(04 May 2009)
doi:10.48550/arxiv.0905.0434
Erratum: Percolation on random Johnson-Mehl tessellations and related models
Bollobas, B
Riordan, O
(08 May 2009)
doi:10.48550/arxiv.0905.1275
Monotone graph limits and quasimonotone graphs
Bollobas, B
Janson, S
Riordan, O
(22 Jan 2011)
doi:10.48550/arxiv.1101.4296
The diameter of sparse random graphs
Riordan, O
Wormald, N
(29 Aug 2008)
doi:10.48550/arxiv.0808.4067