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
Collaborations and top research areas from the last five years
-
Enumeration and random generation of contingency tables with given margins
Wormald, N. & Liebenau, A.
15/09/22 → 14/09/25
Project: Research
-
Enumeration and properties of large discrete structures
Wormald, N. & Liebenau, A.
1/05/18 → 5/07/23
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
-
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
Liebenau, A. & Wormald, N., Mar 2023, In: Random Structures and Algorithms. 62, 2, p. 259-286 28 p.Research output: Contribution to journal › Article › Research › peer-review
Open Access3 Citations (Scopus) -
Asymptotic enumeration of hypergraphs by degree sequence
Kamcev, N., Liebenau, A. & Wormald, N., 3 Feb 2022, In: Advances in Combinatorics. 2022, 36 p., 1.Research output: Contribution to journal › Article › Research › peer-review
Open Access -
Component Games on Random Graphs
Hod, R., Krivelevich, M., Müller, T., Naor, A. & Wormald, N., Dec 2022, In: Combinatorica. 42, Suppl 1, p. 1189-1229 41 p.Research output: Contribution to journal › Article › Research › peer-review
Open Access -
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence
Allendorf, D., Meyer, U., Penschuck, M., Tran, H. & Wormald, N., 2022, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Phillips, C. A. & Speckmann, B. (eds.). USA: Society for Industrial & Applied Mathematics (SIAM), p. 27-40 14 p. (Proceedings of the Workshop on Algorithm Engineering and Experiments; vol. 2022-January).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
Open Access -
Optimal Tree of a Complete Weighted Graph
Soheil Hosseini, S., Wormald, N. & Tian, T., 2022, Recent Advances in Computational Optimization: Results of the Workshop on Computational Optimization WCO 2020. Fidanova, S. (ed.). Cham Switzerland: Springer, Vol. 986. p. 203-219 17 p. (Studies in Computational Intelligence; vol. 986).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research
Open Access