I started my academic career as an undergraduate at the University of Queensland, before obtaining my doctorate from the University of Oxford (1992). I held postdoctoral positions at the University of Leeds and at the University of Melbourne, before joining UNSW in 2002. Today I am a Professor and head of the Combinatorics group in the School of Mathematics and Statistics, UNSW Sydney. My research interests lie in asymptotic, probabilistic and algorithmic combinatorics. I was elected as a Fellow of the Australian Academy of Science in 2022. My work lies at the interface between discrete mathematics, theoretical computer science and probability, and has been applied by researchers in various areas including physics, computer science and statistics.
The study of random combinatorial objects, such as random graphs, is an attempt to discover what a "typical" graph with certain properties might look like (for instance, a given number of vertices and edges, or a given number of vertices and every vertex having a fixed degree). This work involves a mixture of combinatorial and probabilistic arguments, and the results obtained are asymptotic, meaning that they hold in the limit as the number of vertices of the graph tends to infinity.
A related area is asymptotic enumeration of various kinds of graphs. This means finding a formula for the number of graphs of interest which is closer and closer to the truth as the number of vertices tends to infinity. For sparse graphs the methods are combinatorial and often involve a probabilistic approach using switchings. For dense graphs the approach is quite different: we want to to know a particular coefficient of the generating function and proceed using complex analysis, evaluating integrals using the saddle-point method.
I am also interested in the design and analysis of randomized algorithms for graphs and other combinatorial structures, particularly Markov chain Monte Carlo algorithms for approximate sampling and/or counting. Here a Markov chain is designed with a given stationary distribution, for instance the uniform distribution on the set of all graphs with a given degree sequence. The aim is to prove that the Markov chain converges rapidly (i.e. in polynomial time) to this distribution.
My Research Supervision
My Teaching
I teach a range of courses within the School of Mathematics and Statistics, from first year courses such as MATH1081 Discrete Mathematics to the Honours course MATH5425 Graph Theory.
I also developed an online Professional Development course for high school teachers (hosted by OpenLearning), covering the new Networks and Paths syllabus. I regularly take part in the School's Teacher's Professional Development workshops, delivering this material to teachers face-to-face.