Random generation of combinatorial structures from a uniform
Theoretical Computer Science
On Approximately Counting Colorings of Small Degree Graphs
SIAM Journal on Computing
Random Structures & Algorithms
Path coupling: A technique for proving rapid mixing in Markov chains
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Mixing in time and space for discrete spin systems
Mixing in time and space for discrete spin systems
Mixing in time and space for lattice spin systems: A combinatorial view
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Combinatorial criteria for uniqueness of Gibbs measures
Random Structures & Algorithms
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
SIAM Journal on Computing
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
Random Structures & Algorithms
Dobrushin conditions and systematic scan
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Dobrushin conditions for systematic scan with block dynamics
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We show that the Glauber dynamics on proper 9-colourings of the triangular lattice is rapidly mixing, which allows for efficient sampling. Consequently, there is a fully polynomial randomised approximation scheme (FPRAS) for counting proper 9-colourings of the triangular lattice. Proper colourings correspond to configurations in the zero-temperature anti-ferromagnetic Potts model. We show that the spin system consisting of proper 9-colourings of the triangular lattice has strong spatial mixing. This implies that there is a unique infinite-volume Gibbs distribution, which is an important property studied in statistical physics. Our results build on previous work by Goldberg, Martin and Paterson, who showed similar results for 10 colours on the triangular lattice. Their work was preceded by Salas and Sokal's 11-colour result. Both proofs rely on computational assistance, and so does our 9-colour proof. We have used a randomised heuristic to guide us towards rigourous results. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 501–533, 2012 (In (*), Goldberg, Martin and Paterson define \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath, amssymb} \pagestyle{empty} \begin{document} \begin{align*}\nu(X)= {\mathbb{E}\lbrack 1_{\Psi_X,v_X}\rbrack }\end{align*} \end{document} **image** , which is the definition of μ(X) in this article. They give an alterative definition of μ(X), however, as pointed out in the proof of Lemma 13 in (*), their μ(X) =ν (X) indeed. © 2012 Wiley Periodicals, Inc.)