Random sampling of 3‐colorings in ℤ2
DOI10.1002/RSA.20002zbMATH Open1044.60100OpenAlexW3083452082MaRDI QIDQ4736775FDOQ4736775
Russell Martin, Mike Paterson, Leslie Ann Goldberg
Publication date: 6 August 2004
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20002
Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Other physical applications of random processes (60K40)
Cites Work
Cited In (18)
- Randomly coloring planar graphs with fewer colors than the maximum degree
- The mixing time of Glauber dynamics for coloring regular trees
- Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$
- Mixing 3-Colourings in Bipartite Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
- Mixing 3-colourings in bipartite graphs
- Systematic scan for sampling colorings
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID
- Sampling Eulerian orientations of triangular lattice graphs
- Rapid mixing for lattice colourings with fewer colours
- The Blume-Emery-Griffiths model on the FAD point and on the AD line
- Sampling weighted perfect matchings on the square-octagon lattice
- Path coupling without contraction
- Delocalization of uniform graph homomorphisms from \({\mathbb{Z}}^2\) to \({\mathbb{Z}} \)
- Proper -colorings of are Bernoulli
Recommendations
This page was built for publication: Random sampling of 3‐colorings in ℤ2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736775)
