Mark Jerrum
- The Metropolis algorithm for graph bisection
1998/03/01 by Mark Jerrum, Gregory B. Sorkin · 13 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Algorithms and Data Compression
- A complexity dichotomy for partition functions with mixed signs
2008/04/11 by Leslie Ann Goldberg, Martin Grohe, Goldberg, Leslie Ann +5 · 4 citations
Mathematics · Computer Science · #Markov Chains and Monte Carlo Methods #Advanced Combinatorial Mathematics #Advanced Graph Theory Research
- The Parameterised Complexity of Counting Connected Subgraphs and Graph\n Motifs
2013/08/07 by Mark Jerrum, Kitty Meeks, Jerrum, Mark +1 · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods
- Some hard families of parameterised counting problems
2013/10/24 by Mark Jerrum, Kitty Meeks, Jerrum, Mark +1 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods
- Elementary bounds on Poincare and log-Sobolev constants for decomposable Markov chains
2005/03/24 by Mark Jerrum, Jung-Bae Son, Prasad Tetali +1 · 1 citation
Mathematics · #math.PR #msc:60J10 #msc:68W20.
- Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing
2021/06/30 by Konrad Anand, Mark Jerrum, Anand, Konrad +1 · 1 citation
Mathematics · Physics and Astronomy · #Markov Chains and Monte Carlo Methods #Theoretical and Computational Physics #Stochastic processes and statistical mechanics