Projects per year
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
Projects
 3 Finished

Enumeration and properties of large discrete structures
Wormald, N. & Liebenau, A.
1/05/18 → 1/05/21
Project: Research

New approaches to the random generation of combinatorial objects
Wormald, N. & Gao, P.
Australian Research Council (ARC), Monash University
4/04/16 → 30/06/20
Project: Research

Advances in the analysis of random structures and their applications: relationships among models
Australian Research Council (ARC)
1/08/12 → 31/12/17
Project: Research
Research output

A Weightbased Information Filtration Algorithm for Stockcorrelation Networks
Hosseini, S. S., Wormald, N. & Tian, T., 1 Feb 2021, In : Physica A: Statistical Mechanics and its Applications. 563, 14 p., 125489.Research output: Contribution to journal › Article › Research › peerreview

Fast uniform generation of random graphs with given degree sequences
Arman, A., Gao, P. & Wormald, N., 15 Mar 2021, (Accepted/In press) In : Random Structures & Algorithms. 24 p.Research output: Contribution to journal › Article › Research › peerreview

Full rainbow matchings in graphs and hypergraphs
Gao, P., Ramadurai, R., Wanless, I. M. & Wormald, N., 2021, (Accepted/In press) In : Combinatorics Probability and Computing. 19 p.Research output: Contribution to journal › Article › Research › peerreview
Open Access 
Almost all 5regular graphs have a 3flow
Prałat, P. & Wormald, N., 1 Feb 2020, In : Journal of Graph Theory. 93, 2, p. 147156 10 p.Research output: Contribution to journal › Article › Research › peerreview

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. 13711379 9 p. 8948622. (Proceedings  Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019November).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other
1 Citation (Scopus)