Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice
From MaRDI portal
Publication:3091978
DOI10.1112/S1461157000001492zbMath1232.05079arXivmath-ph/0701043OpenAlexW2963197402MaRDI QIDQ3091978
Publication date: 15 September 2011
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math-ph/0701043
Random graphs (graph-theoretic aspects) (05C80) Classical equilibrium statistical mechanics (general) (82B05) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Sampling colourings of the triangular lattice ⋮ Finitary codings for spatial mixing Markov random fields
Cites Work
- Unnamed Item
- Geometric bounds for eigenvalues of Markov chains
- Markov chain comparison
- Random generation of combinatorial structures from a uniform distribution
- Gibbs measures and phase transitions
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- Comparison theorems for reversible Markov chains
- Improved bounds for sampling colorings
- Analyzing Glauber dynamics by comparison of Markov chains
- Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Mixing in time and space for lattice spin systems: A combinatorial view
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Strong Spatial Mixing with Fewer Colors for Lattice Graphs
- Combinatorial criteria for uniqueness of Gibbs measures
This page was built for publication: Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice