Oliver Riordan

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 12

Top Topics

Dense Subgraphs

Frequent Subgraph Mining

Differential Equations

Maximal Cliques

Top Venues

Random Struct. Algorithms

Electron. J. Comb.

Comb. Probab. Comput.

Publications

Oliver Riordan
Random cliques in random graphs and sharp thresholds for F $$ F $$ -factors. Random Struct. Algorithms 61 (4) (2022)
Béla Bollobás, Oliver Riordan
Counting dense connected hypergraphs via the probabilistic method. Random Struct. Algorithms 53 (2) (2018)
Béla Bollobás, Oliver Riordan, Erik Slivken, Paul Smith
The Threshold for Jigsaw Percolation on Random Graphs. Electron. J. Comb. 24 (2) (2017)
Béla Bollobás, Oliver Riordan
Exploring hypergraphs with martingales. Random Struct. Algorithms 50 (3) (2017)
Béla Bollobás, Michal Przykucki, Oliver Riordan, Julian Sahasrabudhe
On the Maximum Running Time in Graph Bootstrap Percolation. Electron. J. Comb. 24 (2) (2017)
Matthew Ashford, Oliver Riordan
Counting racks of order n. Electron. J. Comb. 24 (2) (2017)
Annika Heckel, Oliver Riordan
On the threshold for rainbow connection number r in random graphs. Graphs Comb. 32 (1) (2016)
Béla Bollobás, Oliver Riordan
Counting Connected Hypergraphs via the Probabilistic Method. Comb. Probab. Comput. 25 (1) (2016)
Oliver Riordan, Lutz Warnke
Convergence of Achlioptas Processes via Differential Equations with Unique Solutions. Comb. Probab. Comput. 25 (1) (2016)
Oliver Riordan, Lutz Warnke
The Janson inequalities for general up-sets. Random Struct. Algorithms 46 (2) (2015)
Béla Bollobás, Oliver Riordan
An old approach to the giant component problem. J. Comb. Theory, Ser. B 113 (2015)
Oliver Riordan, Lutz Warnke
The evolution of subcritical Achlioptas processes. Random Struct. Algorithms 47 (1) (2015)
Oliver Riordan
Long cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 45 (4) (2014)
Svante Janson, Oliver Riordan
Susceptibility in Inhomogeneous Random Graphs. Electron. J. Comb. 19 (1) (2012)
Béla Bollobás, Oliver Riordan
Asymptotic normality of the size of the giant component via a random walk. J. Comb. Theory, Ser. B 102 (1) (2012)
Béla Bollobás, Oliver Riordan
Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms 41 (4) (2012)
Annika Heckel, Oliver Riordan
The Hitting Time of Rainbow Connection Number Two. Electron. J. Comb. 19 (4) (2012)
József Balogh, Béla Bollobás, Robert Morris, Oliver Riordan
Linear algebra and bootstrap percolation. J. Comb. Theory, Ser. A 119 (6) (2012)
Béla Bollobás, Oliver Riordan
. Electron. J. Comb. 19 (4) (2012)
Oliver Riordan
The Phase Transition in the Configuration Model. Comb. Probab. Comput. 21 (1-2) (2012)
Béla Bollobás, Svante Janson, Oliver Riordan
Monotone Graph Limits and Quasimonotone Graphs. Internet Math. 8 (3) (2012)
Béla Bollobás, Svante Janson, Oliver Riordan
Sparse random graphs with clustering. Random Struct. Algorithms 38 (3) (2011)
Béla Bollobás, Svante Janson, Oliver Riordan
On covering by translates of a set. Random Struct. Algorithms 38 (1-2) (2011)
Béla Bollobás, Oliver Riordan
Sparse graphs: Metrics and random models. Random Struct. Algorithms 39 (1) (2011)
Svante Janson, Oliver Riordan
Duality in inhomogeneous random graphs, and the cut metric. Random Struct. Algorithms 39 (3) (2011)
Oliver Riordan, Nicholas C. Wormald
The Diameter of Sparse Random Graphs. Comb. Probab. Comput. 19 (5-6) (2010)
Béla Bollobás, Svante Janson, Oliver Riordan
Line-of-Sight Percolation. Comb. Probab. Comput. 18 (1-2) (2009)
Béla Bollobás, Oliver Riordan
Clique percolation. Random Struct. Algorithms 35 (3) (2009)
Oliver Riordan
The k-Core and Branching Processes. Comb. Probab. Comput. 17 (1) (2008)
Béla Bollobás, Oliver Riordan
-fold symmetry. Random Struct. Algorithms 32 (4) (2008)
Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan
Degree distribution of the FKP network model. Theor. Comput. Sci. 379 (3) (2007)
Béla Bollobás, Oliver Riordan
A note on the Harris-Kesten Theorem. Eur. J. Comb. 28 (6) (2007)
Béla Bollobás, Svante Janson, Oliver Riordan
The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31 (1) (2007)
Béla Bollobás, Svante Janson, Oliver Riordan
. Random Struct. Algorithms 31 (2) (2007)
Béla Bollobás, Oliver Riordan
Sharp thresholds and percolation in the plane. Random Struct. Algorithms 29 (4) (2006)
Béla Bollobás, Oliver Riordan
-out graph. Random Struct. Algorithms 27 (1) (2005)
Béla Bollobás, Svante Janson, Oliver Riordan
The phase transition in the uniformly grown random graph has infinite order. Random Struct. Algorithms 26 (1-2) (2005)
Béla Bollobás, Oliver Riordan
The Diameter of a Scale-Free Random Graph. Comb. 24 (1) (2004)
Béla Bollobás, Oliver Riordan
The Phase Transition and Connectedness in Uniformly Grown Random Graphs. WAW (2004)
Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov
On the Value of a Random Minimum Weight Steiner Tree. Comb. 24 (2) (2004)
Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan
Degree Distribution of the FKP Network Model. ICALP (2003)
Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan
Directed scale-free graphs. SODA (2003)
Béla Bollobás, Oliver Riordan
Disjointly representing set systems. J. Comb. Theory, Ser. A 102 (1) (2003)
Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory, Ser. B 87 (2) (2003)
Béla Bollobás, Oliver Riordan
Coupling Scale-Free and Classical Random Graphs. Internet Math. 1 (2) (2003)
Béla Bollobás, Oliver Riordan
Robustness and Vulnerability of Scale-Free Random Graphs. Internet Math. 1 (1) (2003)
Colin Cooper, Alan M. Frieze, Bruce A. Reed, Oliver Riordan
Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. Comb. Probab. Comput. 11 (4) (2002)
Noga Alon, Jaroslaw Grytczuk, Mariusz Haluszczak, Oliver Riordan
Nonrepetitive colorings of graphs. Random Struct. Algorithms 21 (3-4) (2002)
Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor E. Tusnády
The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18 (3) (2001)
Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. 22 (1) (2001)
Béla Bollobás, Oliver Riordan
Polychromatic polynomials. Discret. Math. 219 (1-3) (2000)
Oliver Riordan
Spanning Subgraphs Of Random Graphs. Comb. Probab. Comput. 9 (2) (2000)
Oliver Riordan, Alex Selby
The Maximum Degree Of A Random Graph. Comb. Probab. Comput. 9 (6) (2000)
Béla Bollobás, Luke Pebody, Oliver Riordan
Contraction-Deletion Invariants for Graphs. J. Comb. Theory, Ser. B 80 (2) (2000)
Béla Bollobás, Oliver Riordan
Constrained Graph Processes. Electron. J. Comb. 7 (2000)
Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp
Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. 195 (1-3) (1999)
Béla Bollobás, Oliver Riordan
On some conjectures of Graffiti. Discret. Math. 179 (1-3) (1998)
Oliver Riordan
An Ordering on the Even Discrete Torus. SIAM J. Discret. Math. 11 (1) (1998)
Béla Bollobás, Oliver Riordan
Colorings generated by monotone properties. Random Struct. Algorithms 12 (1) (1998)