Nicholas Wormald

Nicholas Wormald is a Professor in the Department of Mathematical Sciences at Monash University, Australia. He joined the university in 2013 as an Australian Laureate Fellow, following a decade as a Canada Research Chair in Combinatorics and Optimization at the University of Waterloo, Canada. His primary research focuses on combinatorics, probabilistic methods, and random structures, with notable contributions to random graph theory, enumeration, and applications in optimization.

Wormald holds a PhD from the University of Newcastle. His work spans topics including Hamilton cycles in random regular graphs, k-core emergence, probabilistic combinatorics, and algorithms for graph generation. He has contributed to foundational results such as the sudden emergence of giant components in random graphs and the contiguity of random graph models.

He serves on editorial boards of journals like the Electronic Journal of Combinatorics and Random Structures and Algorithms. His research interests also include underground mine optimization and the study of Steiner trees.

Notable projects include enumeration and random generation of contingency tables, properties of large discrete structures, and the analysis of random structures' applications. Wormald has authored or co-authored over 250 publications, with recent work focusing on asymptotic enumeration, hypergraphs, and the probabilistic analysis of combinatorial structures.