Jerrum, Mark
- Random cluster dynamics for the Ising model is rapidly mixing
2016/04/30 by Guo, Heng, Jerrum, Mark · 6 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
- 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
- Uniform Sampling through the Lovász Local Lemma
2016/11/05 by Guo, Heng, Jerrum, Mark, Liu, Jingcheng · 3 citations
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
- 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
- The parameterised complexity of counting even and odd induced subgraphs
2014/10/13 by Jerrum, Mark, Meeks, Kitty · 2 citations
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- The complexity of parity graph homomorphism: an initial investigation
2013/09/16 by Faben, John, Jerrum, Mark · 1 citation
#68Q17 (Primary) 05C15 #68T20 (Secondary) #Combinatorics (math.CO) #Computational Complexity (cs.CC) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
2020/05/16 by Dyer, Martin, Heinrich, Marc, Jerrum, Mark +1 · 1 citation
#68Q25 (Primary) 68Q17 #68Q87 #82B20 (Secondary) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
- 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
- Glauber dynamics for the hard-core model on bounded-degree H-free graphs
2024/04/11 by Jerrum, Mark · 2 citations
#05C69 (Primary) 60J10 #68W20 #82B20 (Secondary) #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)