World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
56
Citations
15423
World Ranking
4012
National Ranking
242

Overview

Mark Jerrum is affiliated with Queen Mary University of London in the United Kingdom. Their research primarily spans the fields of Mathematics and Computer Science, with a focus on several specialized subfields and topics.

The main fields of study for Mark Jerrum include:

  • Mathematics
  • Computer Science

Within these areas, their work addresses key subfields such as:

  • Statistics and Probability
  • Mathematical Physics
  • Artificial Intelligence
  • Condensed Matter Physics
  • Computational Theory and Mathematics

Mark Jerrum's research covers a range of topics which include:

  • Markov Chains and Monte Carlo Methods
  • Stochastic Processes and Statistical Mechanics
  • Theoretical and Computational Physics
  • Advanced Graph Theory Research
  • Bayesian Methods and Mixture Models
  • Graph Theory and Applications
  • Machine Learning and Algorithms

The scientist has several recent publications, such as:

  • "Approximately counting bases of bicircular matroids" (2020), published in Combinatorics Probability Computing
  • "Perfect simulation of the hard disks model by partial rejection sampling" (2021), published in Annales de l'Institut Henri Poincaré D Combinatorics Physics and their Interactions
  • "Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing" (2022), published in SIAM Journal on Computing
  • "Counting weighted independent sets beyond the permanent" (2021), published in Queen Mary Research Online (Queen Mary University of London)
  • "Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs" (2021), published in Queen Mary Research Online (Queen Mary University of London)

Mark Jerrum has collaborated frequently with several researchers, including:

  • Heng Guo
  • Konrad Anand
  • Martin Dyer
  • Haiko Müller
  • Jiaheng Wang

Their research work has appeared repeatedly in a number of publication venues, indicating a focus on both theoretical and applied aspects, such as:

  • arXiv (Cornell University)
  • Combinatorics Probability Computing
  • Annales de l'Institut Henri Poincaré D Combinatorics Physics and their Interactions
  • Queen Mary Research Online (Queen Mary University of London)
  • SIAM Journal on Computing

Best Publications

  • Random generation of combinatorial structures from a uniform distribution

    Mark R. Jerrum;Leslie G. Valiant;Vijay V. Vazirani

  • Approximating the permanent

    M. Jerrum;Alistair Sinclair

  • Approximate counting, uniform generation and rapidly mixing Markov chains

    Alistair Sinclair;Mark Jerrum

  • A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

    Mark Jerrum;Alistair Sinclair;Eric Vigoda

  • Polynomial-time approximation algorithms for the Ising model

    Mark Jerrum;Alistair Sinclair

  • The Markov chain Monte Carlo method: an approach to approximate counting and integration

    Mark Jerrum;Alistair Sinclair

  • Improved approximation algorithms for MAX k-CUT and MAX BISECTION

    Alan M. Frieze;Mark Jerrum

  • Large Cliques Elude the Metropolis Process

    Mark Jerrum

  • Random generation of combinatorial structures from a uniform

    M R Jerrum;L G Valiant;V V Vazirani

  • A very simple algorithm for estimating the number of k -colorings of a low-degree graph

    Mark Jerrum

  • Counting, Sampling and Integrating: Algorithms and Complexity

    Mark Jerrum

  • On the relative complexity of approximate counting problems

    Martin E. Dyer;Leslie Ann Goldberg;Catherine S. Greenhill;Mark Jerrum

  • Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved

    Mark Jerrum;Alistair Sinclair

  • On Counting Independent Sets in Sparse Graphs

    Martin Dyer;Alan Frieze;Mark Jerrum

  • The complexity of finding minimum-length generator sequences

    Mark R. Jerrum

  • Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers

    Paul Goldberg;Mark Jerrum

  • A polynomial algorithm for deciding bisimilarity of normed context-free processes

    Yoram Hirshfeld;Mark Jerrum;Faron Moller

  • Two-dimensional monomer-dimer systems are computationally intractable

    Mark Jerrum

  • Some Exact Complexity Results for Straight-Line Computations over Semirings

    Mark Jerrum;Marc Snir

  • Fast uniform generation of regular graphs

    M. Jerrum;A. Sinclair

  • A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

    Mark Jerrum;Alistair Sinclair;Eric Vigoda

Frequent Co-Authors

Leslie Ann Goldberg
Leslie Ann Goldberg University of Oxford
Martin Dyer
Martin Dyer University of Leeds
Alistair Sinclair
Alistair Sinclair University of California, Berkeley
Alan Frieze
Alan Frieze Carnegie Mellon University
Martin Grohe
Martin Grohe RWTH Aachen University
Marek Karpinski
Marek Karpinski University of Bonn
Jin-Yi Cai
Jin-Yi Cai University of Wisconsin–Madison
Sampath Kannan
Sampath Kannan University of Pennsylvania
Mike Paterson
Mike Paterson University of Warwick
Umesh Vazirani
Umesh Vazirani University of California, Berkeley

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

The expanding field of Computer Science opens doors to a range of online degrees and specialized career options. For students seeking efficient and cost-effective advancement, exploring the cheapest 1 year online mba programs may be beneficial. These accelerated MBAs can be completed quickly and can complement a technical background with essential business acumen.

Those looking to upskill fast might also consider one year masters programs. Such programs are designed for students who want to earn a recognized credential without a multi-year commitment, making them ideal for career changers or those seeking rapid promotion.

For individuals looking for quick returns, there are many easy degrees to get online that pay well. Computer science-related options in IT, cybersecurity, and software development are well-represented and can lead to lucrative roles in a short time frame.

Additionally, the rise of artificial intelligence is fueling demand for specialized programs. Many universities now offer an artificial intelligence degree online at affordable rates. These programs can set you apart in a highly competitive tech landscape and prepare you for cutting-edge roles.

Best Scientists Citing Mark Jerrum

Trending Scientists

Recently Published Articles