Oliver Riordan

发表

Exploring hypergraphs with martingales

Béla Bollobás, Oliver Riordan, 2017, Random Struct. Algorithms.

Spread-out percolation in Rd

Béla Bollobás, Svante Janson, Oliver Riordan, 2007, Random Struct. Algorithms.

The Maximum Degree Of A Random Graph

Oliver Riordan, Alex Selby, 2000, Comb. Probab. Comput..

Contraction-Deletion Invariants for Graphs

Béla Bollobás, Oliver Riordan, Luke Pebody, 2000, J. Comb. Theory B.

Susceptibility in Inhomogeneous Random Graphs

Svante Janson, Oliver Riordan, S. Janson, 2009, Electron. J. Comb..

Nonrepetitive colorings of graphs

Noga Alon, Mariusz Haluszczak, Jaroslaw Grytczuk, 2002, Random Struct. Algorithms.

The Diameter of a Scale-Free Random Graph

Béla Bollobás, Oliver Riordan, B. Bollobás, 2004, Comb..

Counting dense connected hypergraphs via the probabilistic method

Béla Bollobás, Oliver Riordan, 2018, Random Struct. Algorithms.

Closure and Hamiltonian-connectivity of claw-free graphs

Béla Bollobás, Richard H. Schelp, Zdenek Ryjácek, 1999, Discret. Math..

Asymptotic normality of the size of the giant component in a random hypergraph

Béla Bollobás, Oliver Riordan, B. Bollobás, 2011, Random Struct. Algorithms.

A note on the Harris-Kesten Theorem

Béla Bollobás, Oliver Riordan, 2007, Eur. J. Comb..

The Phase Transition and Connectedness in Uniformly Grown Random Graphs

Béla Bollobás, Oliver Riordan, 2004, WAW.

Random Graphs and Branching Processes

Béla Bollobás, Oliver Riordan, B. Bollobás, 2008 .

Degree Distribution of the FKP Network Model

Béla Bollobás, Christian Borgs, Jennifer T. Chayes, 2003, ICALP.

Disjointly representing set systems

Béla Bollobás, Oliver Riordan, B. Bollobás, 2003, J. Comb. Theory, Ser. A.

On the Maximum Running Time in Graph Bootstrap Percolation

Béla Bollobás, Oliver Riordan, Julian Sahasrabudhe, 2017, Electron. J. Comb..

Polychromatic polynomials

Béla Bollobás, Oliver Riordan, B. Bollobás, 2000, Discret. Math..

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial

Béla Bollobás, Paul N. Balister, Oliver Riordan, 2001, Eur. J. Comb..

On covering by translates of a set

Béla Bollobás, Svante Janson, Oliver Riordan, 2009, Random Struct. Algorithms.

Mathematical results on scale‐free random graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 2005 .

Colorings generated by monotone properties

Béla Bollobás, Oliver Riordan, 1998, Random Struct. Algorithms.

An Ordering on the Even Discrete Torus

Oliver Riordan, 1998, SIAM J. Discret. Math..

Sharp thresholds and percolation in the plane

Béla Bollobás, Oliver Riordan, 2006, Random Struct. Algorithms.

The evolution of subcritical Achlioptas processes

Oliver Riordan, Lutz Warnke, O. Riordan, 2012, Random Struct. Algorithms.

Slow emergence of the giant component in the growing m‐out graph

Béla Bollobás, Oliver Riordan, B. Bollobás, 2005, Random Struct. Algorithms.

Basic concepts and results

Béla Bollobás, Oliver Riordan, 2006 .

On some conjectures of Graffiti

Béla Bollobás, Oliver Riordan, 1998, Discret. Math..

Spanning Subgraphs of Random Graphs

Oliver Riordan, O. Riordan, 2000, Combinatorics, Probability and Computing.

Directed scale-free graphs

Béla Bollobás, Christian Borgs, Jennifer T. Chayes, 2003, SODA '03.

Graphs with large maximum degree containing no odd cycles of a given length

Béla Bollobás, Richard H. Schelp, Paul N. Balister, 2003, J. Comb. Theory, Ser. B.

Sparse random graphs with clustering

Béla Bollobás, Svante Janson, Oliver Riordan, 2008, Random Struct. Algorithms.

Scale-Free Cortical Planar Networks

Robert Kozma, Oliver Riordan, Walter J. Freeman, 2008 .

Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number

Alan M. Frieze, Bruce A. Reed, Colin Cooper, 2002, Combinatorics, Probability and Computing.

Percolation on dual lattices with k-fold symmetry

Béla Bollobás, Oliver Riordan, 2008, Random Struct. Algorithms.

The Janson inequalities for general up‐sets

Oliver Riordan, Lutz Warnke, O. Riordan, 2012, Random Struct. Algorithms.

The phase transition in inhomogeneous random graphs

Béla Bollobás, Svante Janson, Oliver Riordan, 2007, Random Struct. Algorithms.

On the threshold for rainbow connection number $$r$$r in random graphs

Oliver Riordan, Annika Heckel, O. Riordan, 2013, Graphs Comb..

The Diameter of Sparse Random Graphs

Nicholas C. Wormald, Oliver Riordan, 2010, Comb. Probab. Comput..

The inefficiency of re-weighted sampling and the curse of system size in high-order path integration

Oliver Riordan, Michele Ceriotti, David E. Manolopoulos, 2011, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

The Threshold for Jigsaw Percolation on Random Graphs

Béla Bollobás, Paul Smith, Oliver Riordan, 2017, Electron. J. Comb..

The degree sequence of a scale‐free random graph process

Béla Bollobás, Joel H. Spencer, Oliver Riordan, 2001, Random Struct. Algorithms.

The consequences of Zipf's law for syntax and symbolic reference

Béla Bollobás, Oliver Riordan, Ramon Ferrer i Cancho, 2005, Proceedings of the Royal Society B: Biological Sciences.

The phase transition in the uniformly grown random graph has infinite order

Béla Bollobás, Svante Janson, Oliver Riordan, 2005, Random Struct. Algorithms.

Constrained Graph Processes

Béla Bollobás, Oliver Riordan, B. Bollobás, 2000, Electron. J. Comb..

On the Value of a Random Minimum Weight Steiner Tree

Béla Bollobás, Benny Sudakov, David Gamarnik, 2004, Comb..

Robustness and Vulnerability of Scale-Free Random Graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 2004, Internet Math..

Duality in inhomogeneous random graphs, and the cut metric

Svante Janson, Oliver Riordan, 2011, Random Struct. Algorithms.

Coupling Scale-Free and Classical Random Graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 2004, Internet Math..

Counting Connected Hypergraphs via the Probabilistic Method

Béla Bollobás, Oliver Riordan, 2016, Comb. Probab. Comput..

The Hitting Time of Rainbow Connection Number Two

Oliver Riordan, Annika Heckel, 2012, Electron. J. Comb..

Line-of-Sight Percolation

Béla Bollobás, Svante Janson, Oliver Riordan, 2009, Comb. Probab. Comput..

Linear algebra and bootstrap percolation

Béla Bollobás, József Balogh, Oliver Riordan, 2012, J. Comb. Theory, Ser. A.

Monotone Graph Limits and Quasimonotone Graphs

Béla Bollobás, Svante Janson, Oliver Riordan, 2011, Internet Math..

An old approach to the giant component problem

Béla Bollobás, Oliver Riordan, B. Bollobás, 2012, J. Comb. Theory, Ser. B.

A Simple Branching Process Approach to the Phase Transition in Gn, p

Béla Bollobás, Oliver Riordan, B. Bollobás, 2012, Electron. J. Comb..

Long cycles in random subgraphs of graphs with large minimum degree

Oliver Riordan, 2014, Random Struct. Algorithms.

Convergence of Achlioptas Processes via Differential Equations with Unique Solutions

Oliver Riordan, Lutz Warnke, O. Riordan, 2011, Combinatorics, Probability and Computing.

Sparse graphs: Metrics and random models

Béla Bollobás, Oliver Riordan, B. Bollobás, 2008, Random Struct. Algorithms.

The Phase Transition in the Configuration Model

Oliver Riordan, O. Riordan, 2011, Combinatorics, Probability and Computing.

Degree distribution of the FKP network model

Béla Bollobás, Christian Borgs, Jennifer T. Chayes, 2003, Theor. Comput. Sci..

Counting racks of order n

Oliver Riordan, Matthew Ashford, O. Riordan, 2016, Electron. J. Comb..

The k-Core and Branching Processes

Oliver Riordan, O. Riordan, 2005, Combinatorics, Probability and Computing.

Asymptotic normality of the size of the giant component via a random walk

Béla Bollobás, Oliver Riordan, 2012, J. Comb. Theory, Ser. B.

Clique percolation

Béla Bollobás, Oliver Riordan, 2009, Random Struct. Algorithms.

How does the chromatic number of a random graph vary?

Oliver Riordan, Annika Heckel, O. Riordan, 2021, 2103.14014.

Achlioptas processes are not always self-averaging.

Oliver Riordan, Lutz Warnke, O. Riordan, 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

Random cliques in random graphs

Oliver Riordan, 2018 .

Achlioptas processes can be nonconvergent

Oliver Riordan, Lutz Warnke, 2011 .

A Tutte Polynomial for Coloured Graphs

Béla Bollobás, Oliver Riordan, B. Bollobás, 1999, Combinatorics, Probability and Computing.

Spread-out percolation in R d

Béla Bollobás, Svante Janson, Oliver Riordan, 2007 .

Explosive Percolation Is Continuous

Oliver Riordan, Lutz Warnke, O. Riordan, 2011, Science.

Sharp thresholds and percolation in the plane

Béla Bollobás, Oliver Riordan, 2006 .

The critical probability for random Voronoi percolation in the plane is 1/2

Béla Bollobás, Oliver Riordan, 2006 .

Slow emergence of the giant component in the growing m-out graph

Béla Bollobás, Oliver Riordan, 2005 .

Clique percolation

Béla Bollobás, Oliver Riordan, 2009 .

Shortest paths and load scaling in scale-free trees.

Béla Bollobás, Oliver Riordan, 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

The phase transition in the uniformly grown random graph has infinite order

Béla Bollobás, Svante Janson, Oliver Riordan, 2005 .

Percolation on random Johnson–Mehl tessellations and related models

Béla Bollobás, Oliver Riordan, 2008 .

Long-range percolation in R^d

Svante Janson, Oliver Riordan, Bela Bollobas, 2005 .

A Polynomial Invariant of Graphs On Orientable Surfaces

Béla Bollobás, Oliver Riordan, B. Bollobás, 2001 .

A Tutte Polynomial for Coloured Graphs

Béla Bollobás, Oliver Riordan, 1999 .

Percolation on dual lattices with k-fold symmetry

Béla Bollobás, Oliver Riordan, 2008 .

A polynomial of graphs on surfaces

Béla Bollobás, Oliver Riordan, B. Bollobás, 2002 .

A pr 2 00 8 Percolation on Dense Graph Sequences Béla Bollobás

Christian Borgs, Oliver Riordan, Jennifer Chayes, 2008 .

A Short Proof of the Harris–Kesten Theorem

Oliver Riordan, Bela Bollobas, B. Bollobás, 2004, math/0410359.

The Small Giant Component in Scale-Free Random Graphs

Oliver Riordan, O. Riordan, 2005, Combinatorics, Probability and Computing.

The Cut Metric, Random Graphs, and Branching Processes

Béla Bollobás, Svante Janson, Oliver Riordan, 2009, 0901.2091.

Colorings generated by monotone properties

Béla Bollobás, Oliver Riordan, 1998 .

Linearized chord diagrams and an upper bound for vassiliev invariants

Béla Bollobás, Oliver Riordan, 2000 .