World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
45
Citations
8054
World Ranking
1470
National Ranking
103

Engineering and Technology

D-Index
45
Citations
7996
World Ranking
5480
National Ranking
362

Overview

Colin McDiarmid is affiliated with the University of Oxford in the United Kingdom. Their research primarily spans the disciplines of Mathematics and Computer Science, with significant contributions to Computational Theory and Mathematics as well as Discrete Mathematics and Combinatorics. Additional subfields of study include Geometry and Topology, Mathematical Physics, and Statistical and Nonlinear Physics.

McDiarmid's work concentrates on several main topics related to graph theory and stochastic processes. These include Limits and Structures in Graph Theory, Advanced Graph Theory Research, Stochastic Processes and Statistical Mechanics, Graph Theory and Applications, Complex Network Analysis Techniques, Advanced Graph Neural Networks, and Topological and Geometric Data Analysis.

Their recent papers demonstrate active engagement with topics in random graphs and combinatorial structures. Notable publications include:

  • Modularity of Erdős-Rényi random graphs (2020), published in Random Structures and Algorithms
  • The component structure of dense random subgraphs of the hypercube (2021), published in Random Structures and Algorithms
  • Classes of graphs embeddable in order-dependent surfaces (2023), published in Combinatorial Theory
  • Random graphs embeddable in order-dependent surfaces (2023), published in Random Structures and Algorithms
  • Connectivity for an unlabelled bridge-addable graph class (2020), published on arXiv (Cornell University)

Frequent coauthors collaborating with McDiarmid include Fiona Skerman, Sophia Saller, Baptiste Louf, Alex Scott, and Paul Withers.

Their publications appear regularly in venues such as arXiv (Cornell University), Random Structures and Algorithms, Combinatorial Theory, the European Journal of Combinatorics, and Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Best Publications

  • Surveys in Combinatorics, 1989: On the method of bounded differences

    Unknown

  • On colouring random graphs

    G. R. Grimmett;C. J. H. McDiarmid

  • Acyclic coloring of graphs

    Noga Alon;Colin Mcdiarmid;Bruce Reed

  • Algorithmic theory of random graphs

    Alan Frieze;Colin McDiarmid

  • Random planar graphs

    Colin McDiarmid;Angelika Steger;Dominic J. A. Welsh

  • Small transversals in hypergraphs

    Vasek Chvátal;Colin McDiarmid

  • Channel Assignment and Weighted Coloring

    Colin McDiarmid;Bruce A. Reed

  • Vertex-Colouring Edge-Weightings

    Louigi Addario-Berry;Ketan Dalal;Colin McDiarmid;Bruce A. Reed

  • On integer points in polyhedra

    William J. Cook;Mark Hartmann;Ravi Kannan;Colin McDiarmid

  • On the maximum queue length in the supermarket model

    Malwina J. Luczak;Colin McDiarmid

  • Rado's theorem for polymatroids

    Colin J. H. McDiarmid

  • Building heaps fast

    C. J. McDiarmid;B. A. Reed

  • The Solution of a Timetabling Problem

    Unknown

  • Integer realizations of disk and segment graphs

    Colin Mcdiarmid;Tobias MüLler

  • Total colouring regular bipartite graphs is NP-hard

    Colin J. H. McDiarmid;Abdón Sánchez-Arroyo

  • Random Minimum Length Spanning Trees in Regular Graphs

    Andrew Beveridge;Alan M. Frieze;Colin McDiarmid

  • Concentration for Independent Permutations

    Colin McDiarmid

  • Minimal Positions in a Branching Random Walk

    Colin McDiarmid

  • Graph Imperfection

    Stefanie Gerke;Colin McDiarmid

  • Colouring random graphs

    Colin McDiarmid

  • Random graphs on surfaces

    Colin McDiarmid

  • Topics in Chromatic Graph Theory: Colouring random graphs

    Ross J. Kang;Colin McDiarmid

  • SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing

    Colin McDiarmid

Frequent Co-Authors

Bruce Reed
Bruce Reed McGill University
Alan Frieze
Alan Frieze Carnegie Mellon University
Martin Dyer
Martin Dyer University of Leeds
Noga Alon
Noga Alon Tel Aviv University
Svante Janson
Svante Janson Uppsala University
Geoffrey Grimmett
Geoffrey Grimmett University of Cambridge
Luc Devroye
Luc Devroye McGill University
Michael Krivelevich
Michael Krivelevich Tel Aviv University
Michael Molloy
Michael Molloy University of Toronto

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can open up diverse career opportunities. Many graduates consider advancing their knowledge with business-focused programs such as the cheapest 1 year online MBA programs. These programs offer a swift, affordable path to gaining essential management skills.

Transferability is another key consideration. Students looking to continue education without losing credits should look into options that accept transfer credits. Programs featuring online MBA transfer credits provide flexibility and reduce time and cost commitments.

For those interested in the analytical and data-driven side of Mathematics, a masters in data analytics is an excellent pathway. This degree equips students with skills in big data, machine learning, and statistical modeling, opening doors to high-demand tech and financial sectors.

Finally, prospective students may want to consider the admission requirements of business schools. Finding an easiest MBA program to get into can make graduate education more accessible while still providing valuable knowledge for career advancement.

Best Scientists Citing Colin McDiarmid

Trending Scientists

Recently Published Articles