معرفی
Mark Jerrum is a Professor of Mathematics at Queen Mary University of London, part of the School of Mathematical Sciences. His research focuses on combinatorics, computational complexity, and stochastic processes, particularly in the design and analysis of randomized algorithms. He explores the mixing times of Markov chains and computational complexity of counting problems, including partition functions and generating functions, often motivated by statistical physics, constraint satisfaction, and graph polynomials.
Notable grants include an EPSRC-funded project on Sampling in Hereditary Classes (EP/S016694/1, 2019–2023). He has contributed to teaching, serving as module organiser for MTH4213 (Numbers, Sets and Functions) in 2023–24. His work bridges theoretical computer science and discrete mathematics, with applications in algorithmic design and probabilistic analysis.
Research highlights include advancements in perfect sampling algorithms, approximation algorithms for counting problems, and foundational work on the interplay between statistical physics models and computational complexity. He is affiliated with the Centre for Combinatorics, Algebra and Number Theory, reflecting his interdisciplinary approach to combinatorial and algorithmic challenges.
