Mark Jerrum’s research interests lie in combinatorics, computational complexity and stochastic processes. All of these ingredients come together in the study of randomised algorithms: computational procedures that exploit the surprising power of making random choices. A strong theme in this work is the analysis of the mixing time of combinatorially or geometrically defined Markov chains. More generally, he works on the computational complexity of counting problems, including weighted counting problems, as exemplified by partition functions and generating functions. Statistical physics, constraint satisfaction and graph polynomials provide a rich source of motivating examples.
He is Director of Research in the School of Mathematical Sciences and is module organiser for MTH6140 Linear Algebra II. He serves on the editorial boards of SIAM Journal on Computing and Random Structures and Algorithms.
MTH 5104, Convergence and Continuity
Examples of research funding:
EPSRC research grant Sampling in Hereditary Classes, EP/S016694/1. Start date 01/01/19, end date 31/12/21. £78K.