PhD Scholarships at Monash

Outstanding candidates are sought for PhD scholarships in combinatorics, in particular random graph theory, random networks and probabilistic combinatorics. The scholarships are associated with the Australian Laureate Fellowship held by Nick Wormald.

This area of pure mathematics uses graph theory, probability theory and some analytic methods. It is of fundamental interest in understanding the nature of random structures such as models of the world wide web or other large networks and are also interrelated to asymptotic enumeration of structures such as graphs. There are growing numbers of applications in algorithmic Computer Science, and results in the area can lead to novel algorithms for practical problems, or to new understanding of the inherent difficulties of the computational solutions of problems. See http://users.monash.edu.au/~nwormald/ for more information on recent research.

Successful applicants will join in the activities of the School of Mathematical Sciences, Monash University, and interact with the University's very active Discrete Mathematics group (http://www.csse.monash.edu.au/~gfarr/research/res-gp-mtgs.html).

Candidates should have an honours degree or equivalent in pure mathematics or a closely associated discipline. Experience with graphs, discrete probability and/or complex analysis and measure theory are highly advantageous.

The scholarships cover living allowance, as well as being able to cover tuition fees in the case of International students.

Application method: by 15 December 2014, send an email to Nick Wormald including:
 • your academic transcript (of all subjects studied and marks obtained),
 • a brief CV, including publications if any, and
 • a list with full contact details of at least two (preferably three) referees, mentioning their relationship to you.

For further enquiries, email Nick Wormald.