Jerrum, Mark
(as bibtex)
Elsewhere:
[math people]
[google]
[google scholar]
Articles (18)

Jerrum, Mark, Guo, Heng.
Random cluster dynamics for the Ising model is rapidly mixing.
The Annals of Applied Probability
2018.
28:12921313

Goldberg, Leslie Ann, Jerrum, Mark.
A counterexample to rapid mixing of the GeStefankovic process.
Electronic Communications in Probability
2012.
17:16

Jerrum, Mark, Goldberg, Leslie.
A counterexample to rapid mixing of the GeŠtefankovič
process.
Electronic Communications in Probability
2012.
2012:

Goldberg, Leslie Ann, Jerrum, Mark, Karpinski, Marek.
The mixing time of Glauber dynamics for coloring regular trees.
Random Structures & Algorithms
2010.
36:464476

Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark.
Matrix norms and rapid mixing for spin systems.
The Annals of Applied Probability
2009.
19:71107

Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark, Martin, Russell.
Markov chain comparison.
Probability Surveys
2006.
3:89111

Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark.
Systematic scan for sampling colorings.
The Annals of Applied Probability
2006.
16:185230

Jerrum, Mark.
On the approximation of one Markov chain by another.
Probability Theory and Related Fields
2006.
135:114

Jerrum, Mark, Son, JungBae, Tetali, Prasad, Vigoda, Eric.
Elementary bounds on poincaré and logSobolev constants for decomposable Markov chains.
The Annals of Applied Probability
2004.
14:17411765

Dyer, Martin, Jerrum, Mark, Winkler, Peter.
Preface.
Brazilian Journal of Probability and Statistics
2004.
24:233233

Goldberg, Leslie Ann, Jerrum, Mark, Paterson, Mike.
The computational complexity of twostate spin systems.
Random Structures & Algorithms
2003.
22:133154

Jerrum, Mark, Dyer, Martin, Bubley, Russ.
An elementary analysis of a procedure for sampling points in a convex body†.
Random Structures & Algorithms
1998.
12:213235

Jerrum, Mark, Sorkin, Gregory B..
The Metropolis algorithm for graph bisection.
Discrete Applied Mathematics
1998.
82:155175

Bubley, Russ, Dyer, Martin, Jerrum, Mark.
An elementary analysis of a procedure for sampling points in a convex body.
Random Structures & Algorithms
1998.
12:213235

Jerrum, Mark.
A very simple algorithm for estimating the number of $k$colorings of a lowdegree graph.
Random Structures & Algorithms
1995.
7:157165

Jerrum, Mark.
A very simple algorithm for estimating the number of kcolorings of a lowdegree graph.
Random Structures & Algorithms
1995.
6:157165

Jerrum, Mark.
Review: E. G. Coffman, George S. Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms.
The Annals of Probability
1992.
20:21642167

Jerrum, Mark.
Large cliques elude the metropolis process.
Random Structures & Algorithms
1992.
3:347359