ProbabilityMathematicsGraph TheoryAsymptotic EnumerationAnalysis of Graph AlgorithmsRandom GraphsSteiner TreesOptimisation of NetworksRandom Graph ProcessesProbabilistic Combinatorics
Citation at year of election
Nicholas Wormald is one of an elite group of mathematicians globally who combine the most advanced probability theory, combinatorics and theoretical computer science to produce deep insights into the nature of random and complex networks. He specialises in random graphs and probabilistic combinatorics, graph theory, enumeration, the analysis of graph algorithms, Steiner trees, the analysis of real-life networks, and other areas in combinatorics, as well as the optimisation of underground mine access networks. Wormald is responsible for an impressive number of major breakthroughs in these areas and many standard methods used today were his invention.