Home Page of Mark Jerrum
Hitch and me.
||School of Mathematical Sciences
Queen Mary, University of London
Mile End Road
London E1 4NS
||Professor of Pure Mathematics
||Queens' Building W319
||m DOT jerrum AT qmul DOT ac DOT uk
||+44 (0)20 7882 5472
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.
My research, conducted together with current postdoctoral research assistant (PDRA) Tamás Makai and previous PDRA Heng Guo, is supported by an EPSRC grant Algorithms that count: exploring the limits of tractability. Prior to that, I was a coinvestigator on Computational Counting, a joint project with Martin Dyer (Leeds) and Leslie Ann Goldberg (Oxford).
Some publications are available
Or, for a more nearly complete listing of publications, click
(This listing is generated in real time by
Linear Algebra II.
My Office hours can be found
- James Matthews (graduated 2008).
- John Faben (graduated 2012).
I am Director of Research in the School of Mathematical
In my spare time I butcher families.
This page is maintained by Mark Jerrum.
The views and opinions expressed in these pages are mine.
The contents of these pages have not been reviewed or approved by
Queen Mary, University of London.