His primary scientific interests are in Combinatorics, Discrete mathematics, Random graph, Random regular graph and Dense graph. The concepts of his Combinatorics study are interwoven with issues in Distribution and Generalization. He works mostly in the field of Discrete mathematics, limiting it down to topics relating to Degree and, in certain cases, Power law and Scale, as a part of the same area of interest.
His work on Giant component and Barabási–Albert model is typically connected to Watts and Strogatz model as part of general Random graph study, connecting several disciplines of science. His work focuses on many connections between Giant component and other disciplines, such as Line graph, that overlap with his field of interest in Multiple edges and Exponential random graph models. His Random regular graph research focuses on Path graph and how it connects with Wheel graph and Complement graph.
His primary areas of investigation include Combinatorics, Discrete mathematics, Random graph, Giant component and Graph. Combinatorics and Upper and lower bounds are frequently intertwined in his study. His study in the field of Random regular graph, Path graph and Graph power also crosses realms of Continuum percolation theory.
His Random regular graph research includes themes of Indifference graph and Dense graph. The Random graph study combines topics in areas such as Phase transition, Null graph, Branching process and Degree. As a part of the same scientific family, he mostly works in the field of Giant component, focusing on Random walk and, on occasion, Martingale.
Oliver Riordan spends much of his time researching Combinatorics, Discrete mathematics, Random graph, Graph and Hypergraph. In the field of Combinatorics, his study on Degree overlaps with subjects such as struct. While the research belongs to areas of Discrete mathematics, Oliver Riordan spends his time largely on the problem of Branching process, intersecting his research to questions surrounding Sequence, Giant component and Probability distribution.
The study incorporates disciplines such as Vertex, Null graph, Binomial and Product rule in addition to Random graph. The Bootstrap percolation research Oliver Riordan does as part of his general Graph study is frequently linked to other disciplines of science, such as Running time, therefore creating a link between diverse domains of science. The various areas that Oliver Riordan examines in his Hypergraph study include Martingale, Probabilistic method, Matching, Range and Generalization.
Oliver Riordan mainly focuses on Combinatorics, Random graph, Discrete mathematics, struct and Graph. His Large deviations theory research extends to Combinatorics, which is thematically connected. His research integrates issues of Event, Mathematical proof and Distribution in his study of Large deviations theory.
His research in Random graph tackles topics such as Vertex which are related to areas like Null graph, Neighbourhood and Product rule. Oliver Riordan undertakes multidisciplinary investigations into Discrete mathematics and Continuum percolation theory in his work. His work deals with themes such as Probability distribution, Degree, Giant component, Constant and Sequence, which intersect with Branching process.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The degree sequence of a scale-free random graph process
Béla Bollobás;Oliver Riordan;Joel Spencer;Gábor Tusnády.
Random Structures and Algorithms (2001)
The degree sequence of a scale-free random graph process
Béla Bollobás;Oliver Riordan;Joel Spencer;Gábor Tusnády.
Random Structures and Algorithms (2001)
The phase transition in inhomogeneous random graphs
Béla Bollobás;Svante Janson;Oliver Riordan.
Random Structures and Algorithms (2007)
The phase transition in inhomogeneous random graphs
Béla Bollobás;Svante Janson;Oliver Riordan.
Random Structures and Algorithms (2007)
The Diameter of a Scale-Free Random Graph
Bélaa Bollobás;Oliver Riordan.
Combinatorica (2004)
The Diameter of a Scale-Free Random Graph
Bélaa Bollobás;Oliver Riordan.
Combinatorica (2004)
Mathematical results on scale‐free random graphs
Béla Bollobás;Béla Bollobás;Oliver M. Riordan.
(2005)
Mathematical results on scale‐free random graphs
Béla Bollobás;Béla Bollobás;Oliver M. Riordan.
(2005)
Directed scale-free graphs
Béla Bollobás;Christian Borgs;Jennifer Chayes;Oliver Riordan.
symposium on discrete algorithms (2003)
Directed scale-free graphs
Béla Bollobás;Christian Borgs;Jennifer Chayes;Oliver Riordan.
symposium on discrete algorithms (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Memphis
Uppsala University
University of California, Berkeley
Microsoft (United States)
MIT
ETH Zurich
University of Illinois at Urbana-Champaign
Courant Institute of Mathematical Sciences
University of Memphis
Tel Aviv University
Radboud University Nijmegen
University of Massachusetts Amherst
Chinese Academy of Sciences
Institut Laue-Langevin
Cornell University
ETH Zurich
Discovery Institute
Wageningen University & Research
École Polytechnique
University of Canterbury
Birkbeck, University of London
University of Washington
McGill University
University of Alberta
University of Sussex
University of Manchester