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:

### Keywords

- random structures
- probabilistic combinatorics
- combinatorics

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

## Projects 2012 2019

## New approaches to the random generation of combinatorial objects

Wormald, N. & Gao, P.

Australian Research Council (ARC), Monash University

4/04/16 → 31/12/19

Project: Research

## Enumeration and properties of large discrete structures

Wormald, N. & Liebenau, A.

1/01/18 → 31/12/18

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 1975 2018

## Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs

Hoppen, C. & Wormald, N., Jun 2018, In : Combinatorica. 38, 3, p. 619-664 46 p.Research output: Contribution to journal › Article › Research › peer-review

## The Number of Satisfying Assignments of Random Regular k-SAT Formulas

Coja-Oghlan, A. & Wormald, N., 1 Jul 2018, In : Combinatorics Probability and Computing. 27, 4, p. 496-530 35 p.Research output: Contribution to journal › Article › Research › peer-review

## The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph

Stark, D. & Wormald, N., 1 Jul 2018, In : Combinatorics Probability and Computing. 27, 4, p. 672-715 44 p.Research output: Contribution to journal › Article › Research › peer-review

## Uniform generation of random graphs with power-law degree sequences

Gao, P. & Wormald, N., 1 Jan 2018,*Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018; Astor Crowne Plaza - New Orleans French QuarterNew Orleans; United States; 7 January 2018 through 10 January 2018.*Czumaj, A. (ed.). Association for Computing Machinery (ACM), p. 1741-1758 18 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research

## Almost all 5-regular graphs have a 3-flow

Prałat, P. & Wormald, N., 2017, In : Trends in Mathematics. 6, p. 89-94 6 p.Research output: Contribution to journal › Article › Other › peer-review