Oliver Riordan

From MaRDI portal
Person:243307

Available identifiers

zbMath Open riordan.oliverWikidataQ102257642 ScholiaQ102257642MaRDI QIDQ243307

List of research outcomes

PublicationDate of PublicationType
How does the chromatic number of a random graph vary?2023-12-19Paper
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors2023-10-17Paper
Essential properties of the Tutte polynomial2023-04-28Paper
A note on Linnik's theorem on quadratic non-residues2019-03-27Paper
Sesqui-type branching processes2018-10-31Paper
Counting dense connected hypergraphs via the probabilistic method2018-09-25Paper
Convergence of Achlioptas Processes via Differential Equations with Unique Solutions2017-10-04Paper
Counting Connected Hypergraphs via the Probabilistic Method2017-10-04Paper
The threshold for jigsaw percolation on random graphs2017-07-13Paper
Counting racks of order \(n\)2017-06-13Paper
Exploring hypergraphs with martingales2017-06-02Paper
On the maximum running time in graph bootstrap percolation2017-05-18Paper
The phase transition in bounded-size Achlioptas processes2017-04-27Paper
A local limit theorem for Quicksort key comparisons via multi-round smoothing2017-01-16Paper
On the threshold for rainbow connection number \(r\) in random graphs2016-03-02Paper
The evolution of subcritical Achlioptas processes2015-10-12Paper
Long cycles in random subgraphs of graphs with large minimum degree2015-06-22Paper
An old approach to the giant component problem2015-06-10Paper
The Janson inequalities for general up‐sets2015-04-09Paper
The Phase Transition in the Erdős-Rényi Random Graph Process2014-05-19Paper
Essential enhancements revisited2014-02-04Paper
A simple branching process approach to the phase transition in \(G_{n,p}\)2013-06-07Paper
The hitting time of rainbow connection number two2013-06-07Paper
The Diameter of Sparse Random Graphs2013-03-13Paper
Monotone Graph Limits and Quasimonotone Graphs2013-02-15Paper
Asymptotic normality of the size of the giant component in a random hypergraph2012-12-14Paper
Achlioptas process phase transitions are continuous2012-09-19Paper
The inefficiency of re-weighted sampling and the curse of system size in high-order path integration2012-07-31Paper
Susceptibility in inhomogeneous random graphs2012-06-12Paper
Linear algebra and bootstrap percolation2012-06-04Paper
The Phase Transition in the Configuration Model2012-05-14Paper
Asymptotic normality of the size of the giant component via a random walk2012-03-19Paper
https://portal.mardi4nfdi.de/entity/Q30967082011-11-11Paper
Duality in inhomogeneous random graphs, and the cut metric2011-10-25Paper
Sparse graphs: Metrics and random models2011-08-09Paper
Sparse random graphs with clustering2011-05-11Paper
Percolation on self-dual polygon configurations2011-02-18Paper
On covering by translates of a set2011-01-17Paper
Clique percolation2010-11-09Paper
The cut metric, random graphs, and branching processes2010-09-16Paper
Line-of-Sight Percolation2010-04-23Paper
Percolation on dense graph sequences2010-03-08Paper
Erratum to: percolation on random Johnson-Mehl tessellations and related models2010-02-09Paper
Metrics for sparse graphs2010-01-13Paper
Percolation on dual lattices withk-fold symmetry2008-07-21Paper
Percolation on random Johnson-Mehl tessellations and related models2008-04-03Paper
Thek-Core and Branching Processes2008-03-10Paper
Spread‐out percolation in d2008-01-08Paper
The phase transition in inhomogeneous random graphs2007-09-21Paper
A note on the Harris-Kesten theorem2007-07-27Paper
Degree distribution of the FKP network model2007-07-16Paper
Sharp thresholds and percolation in the plane2007-02-07Paper
Percolation2006-12-04Paper
The critical probability for random Voronoi percolation in the plane is 1/22006-10-16Paper
A SHORT PROOF OF THE HARRIS–KESTEN THEOREM2006-08-10Paper
The Small Giant Component in Scale-Free Random Graphs2005-11-14Paper
Slow emergence of the giant component in the growing m‐out graph2005-08-29Paper
Algorithms and Models for the Web-Graph2005-08-22Paper
Robustness and Vulnerability of Scale-Free Random Graphs2005-05-09Paper
The phase transition in the uniformly grown random graph has infinite order2005-04-21Paper
Coupling Scale-Free and Classical Random Graphs2005-04-11Paper
On the value of a random minimum weight Steiner tree2005-02-14Paper
The diameter of a scale-free random graph2004-10-19Paper
https://portal.mardi4nfdi.de/entity/Q44712872004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44492152004-02-08Paper
Graphs with large maximum degree containing no odd cycles of a given length2003-08-25Paper
Disjointly representing set systems2003-05-27Paper
Nonrepetitive colorings of graphs2003-03-19Paper
Vertex-distinguishing edge colorings of graphs2003-03-10Paper
Contraction-deletion invariants for graphs2002-12-10Paper
Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number2002-11-12Paper
A polynomial of graphs on surfaces2002-09-17Paper
Linearized chord diagrams and an upper bound for vassiliev invariants2002-07-30Paper
The degree sequence of a scale-free random graph process2002-05-13Paper
A Polynomial Invariant of Graphs On Orientable Surfaces2002-01-28Paper
The Maximum Degree of a Random Graph2001-10-30Paper
Alternating knot diagrams, Euler circuits and the interlace polynomial2001-09-18Paper
Polychromatic polynomials2000-11-19Paper
Spanning Subgraphs of Random Graphs2000-08-14Paper
Constrainted graph processes2000-04-16Paper
Closure and Hamiltonian-connectivity of claw-free graphs1999-11-02Paper
A Tutte Polynomial for Coloured Graphs1999-05-11Paper
https://portal.mardi4nfdi.de/entity/Q43797261998-08-31Paper
An Ordering on the Even Discrete Torus1998-05-11Paper
On some conjectures of Graffiti1998-05-06Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Oliver Riordan