Prof Mark Jerrum

Mark Jerrum

Professor of Mathematics

School of Mathematical Sciences
Queen Mary University of London
www.maths.qmul.ac.uk/~mj/
Centre for Combinatorics, Algebra and Number Theory
ORCID

Research

Applied probability, Combinatorics, Theoretical computer science

Interests

I am interested 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, I work on the computational complexity of counting problems, including weighted counted problems as exemplified by partition functions and generating functions. Statistical physics, Constraint Satisfaction Problems and graph polynomials provide a rich source of motivating examples.