Probabilistic combinatorics

The probabilistic method is a powerful tool which has been especially influential in the fields of combinatorics and computer science. In the context of combinatorics, this method was pioneered by Erdős, who demonstrated that random constructions could often be effective in settings where explicit constructions are infeasible. These ideas, establishing a correspondence between counting and probability, allow for the application of tools from probability theory to combinatorial problems and motivate the study of the typical properties of various combinatorial models, such as the Erdős–Rényi random graph, and discrete random processes. The aim of this project is for the student to develop an understanding of these tools and to apply these techniques to open research problems in the field.

Entry requirements:

We are looking for an enthusiastic and highly-motivated graduate with

- a first class degree in Mathematics at the Master’s level (or equivalent);

- a strong background in combinatorics and discrete probability, or related fields;

- good communication skills (oral and written).

The application procedure and the deadlines for scholarship applications are advertised at https://www.birmingham.ac.uk/study/postgraduate/subjects/mathematics-courses/pure-mathematics-phd

The project will be supervised by Dr Joshua Erde ([email protected]).