Nicholas Wormald

Professor

1975 …2020

Research output per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Biography

Nick works in the School of Mathematical Sciences at Monash University as a Professor.

He has worked on many topics in combinatorics - see his personal web page linked below. His main interest is in random structures - such as random networks. There are many things that we can prove the existence of, yet it is not known how to construct one, using a probabilistic approach. We can sometimes show the probability that something exists is nonzero using properties of random structures. Studying the random structures can involve many areas of mathematics such as graph theory, enumeration methods, probability theory, analysis (including e.g. differential equations, complex analysis). Nick has also worked on applications of mathematics to the optimisation of underground mines.  

Nick has a PhD from the University of Newcastle, and after that moved between countries seven times to take up various positions. He joined the School in 2013 as an Australian Laureate Fellow, moving from Waterloo, Canada where he held a Canada Research Chair in Combinatorics and Optimization for ten years. 

Related Links:

Research area keywords

  • random structures
  • probabilistic combinatorics
  • combinatorics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects

Research Output

Almost all 5-regular graphs have a 3-flow

Prałat, P. & Wormald, N., 1 Feb 2020, In : Journal of Graph Theory. 93, 2, p. 147-156 10 p.

Research output: Contribution to journalArticleResearchpeer-review

Fast Uniform Generation of Random Graphs with Given Degree Sequences

Arman, A., Gao, P. & Wormald, N., 20 Jan 2020, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019: 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019; Baltimore; United States; 9 November 2019 through 12 November 2019. Piscataway NJ USA: IEEE Computer Society, p. 1371-1379 9 p. 8948622. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019-November).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

The height of depth-weighted random recursive trees

Leckey, K., Mitsche, D. & Wormald, N., May 2020, In : Random Structures & Algorithms. 56, 3, p. 851-866 16 p.

Research output: Contribution to journalArticleResearchpeer-review

A limit theorem for the six-length of random functional graphs with a fixed degree sequence

Leckey, K. & Wormald, N., 22 Nov 2019, In : Electronic Journal of Combinatorics. 26, 4, 17 p., P4.35.

Research output: Contribution to journalArticleResearchpeer-review

Open Access
File

Meyniel's conjecture holds for random d-regular graphs

Prałat, P. & Wormald, N., 1 Jan 2019, In : Random Structures & Algorithms. 55, 3, p. 719-741 23 p.

Research output: Contribution to journalArticleResearchpeer-review