Prof. Colin McDiarmid

BSc, MSc, DPhil

Status

Emeritus

Professor of Combinatorics Chair of the Stochastics, Discrete Mathematics and Information panel

Contact form

http://www.stats.ox.ac.uk/people/academic_staff/colin_mcdiarmid

+44 1865 272872

Research groups

Combinatorics

Address
Mathematical Institute
University of Oxford
Andrew Wiles Building
Radcliffe Observatory Quarter
Woodstock Road
Oxford
OX2 6GG

Recent books

Random Graphs, Geometry and Asymptotic Structure Krivelevich, M (25 April 2016)

Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh Grimmett, G (1 September 2007)

Preface Grimmett, G (1 September 2007)

Combinatorics, Complexity and Chance Grimmett, G (2007)

Recent publications

The component structure of dense random subgraphs of the hypercube

McDiarmid, C Scott, A Withers, P RANDOM STRUCTURES & ALGORITHMS (12 Feb 2021) http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000617303100001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=4fd6f7d59a501f9b8bac2be37914c43e

Learning random points from geometric graphs or orderings

Diaz, J McDiarmid, C Mitsche, D RANDOM STRUCTURES & ALGORITHMS volume 57 issue 2 339-370 (September 2020) http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000527372200001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=4fd6f7d59a501f9b8bac2be37914c43e

Modularity of Erdos-Renyi random graphs

McDiarmid, C Skerman, F RANDOM STRUCTURES & ALGORITHMS volume 57 issue 1 211-243 (August 2020) http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000520715800001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=4fd6f7d59a501f9b8bac2be37914c43e

Extremal Distances for Subtree Transfer Operations in Binary Trees

Atkins, R McDiarmid, C ANNALS OF COMBINATORICS volume 23 issue 1 1-26 (March 2019) http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000460682200001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=4fd6f7d59a501f9b8bac2be37914c43e

On the critical densities of minor-closed classes

McDiarmid, C Przykucki, M European Journal of Combinatorics volume 75 66-91 (1 January 2019)

Preferred address

Department of Statistics 1 South Parks Road Oxford OX1 3TG

Major / recent publications

Random cubic planar graphs, Random Structures and Algorithms 30 (2007) 78 -- 94. (Joint with Manuel Bodirsky, Mihyun Kang and Mike Loeffler.)

Random planar graphs with given average degree, in Combinatorics, Complexity and Chance, a tribute to Dominic Welsh (G. Grimmett and C. McDiarmid eds) Oxford University Press, 2007, 83 -- 102. (Joint with Stefanie Gerke, Angelika Steger and Andreas Weissl.)

Asymptotic distributions and chaos for the supermarket model, Electronic Journal of Probability 12 (2007) 75 -- 99. (Joint with Malwina Luczak.)

Vertex-Colouring Edge-Weightings, Combinatorica 27 (1) (2007) 1 -- 12. (Joint with L.Addario-Berry, K.Dalal, B.A.Reed and A.Thomason.)

On the span of a random channel assignment problem, Combinatorica 27 (2007) 183 -- 203.

List colouring squares of planar graphs.
Electronic Notes in Discrete Mathematics 29 (2007) 515 -- 519. (Joint with Frederic Havet, Jan van den Heuvel and Bruce Reed.)

The t-improper chromatic number of random graphs.
Electronic Notes in Discrete Mathematics 29 (2007) 411 -- 417. (Joint with Ross Kang.)

Random graphs on surfaces, J. Combinatorial Theory B 98 (2008) 778 -- 797.

On the maximum degree of a random planar graph, Combinatorics, Probability and Computing 17 (2008) 591-- 601. (Joint with Bruce Reed.)

Random graphs from a minor-closed class, Combinatorics, Probability and Computing 18 (2009) 583-599.

Highlighted publications

On the chromatic number of random geometric graphs

McDiarmid, C Müller, T Combinatorica, Volume 31 (2011), Number 4, Pages 423-488 volume 31 issue 4 423-488 (31 January 2011) http://arxiv.org/abs/1101.6065v3

Random unlabelled graphs containing few disjoint cycles

Kang, M McDiarmid, C Random Structures and Algorithms volume 38 issue 1-2 174-204 (2011)

Random hyperplane search trees

Devroye, L King, J McDiarmid, C SIAM Journal on Computing volume 38 issue 6 2411-2425 (1 June 2009)

Random graphs on surfaces

McDiarmid, C Journal of Combinatorial Theory. Series B volume 98 issue 4 778-797 (1 July 2008)

Balanced routing of random calls

Luczak, M McDiarmid, C Annals of Applied Probability volume 25 issue 3 1279-1324 (8 January 2008) http://arxiv.org/abs/0801.1260v3

Teaching

Combinatorial Optimisation

Research interests

Discrete mathematics, random structures, algorithms and complexity, combinatorial optimisation, mathematics of operational research