Random graphs are ubiquitous objects in probability and combinatorics and are widely used by mathematicians to understand properties of complex networks in the everyday world. This project focuses on models of random graphs that exhibit clustering, a feature that is often present in various social networks. The aim is to investigate the behaviour of these graphs when the graph size is large, using tools from stochastic analysis as well as combinatorics.  

 If you are passionate about research in probability, you are most welcome to apply. An excellent understanding in probability theory and particularly stochastic processes is desirable, but training will be in place to help you develop expertise and skills that are relevant to the project.  

 You will work with Dr.Minmin Wang and join the probability and statistics research group. The group, with 6 permanent members and several early career researchers, has a vibrant research atmosphere and hosts regular seminar series.  

Applicants must hold, or expect to hold, at least a UK upper second-class degree (or non-UK equivalent qualification) in Mathematics, or a closely-related area, or else a lower second-class degree followed by a relevant Master's degree.

This award is open to international and UK-based students.

If you are not a UK national, nor a EU national with UK settled/pre-settled status, you will need to apply for a student study visa before admission.