Oliver Riordan

61 papers A* 2C 1Journal 57

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