Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings (Q1775018): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A constrained Potts antiferromagnet model with an interface representation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comparison theorems for reversible Markov chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antiferromagnetic Potts models on the square lattice: A high-precision Monte Carlo study / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time-Dependent Statistics of the Ising Model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4519896 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Brooks' Theorem for Sparse Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5815557 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3140234 / rank | |||
Normal rank |
Latest revision as of 11:02, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings |
scientific article |
Statements
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings (English)
0 references
4 May 2005
0 references
As in the related paper by \textit{E. Vigoda} [J.\ Math.\ Phys.\ 41, 1555--1569 (2000; Zbl 0978.60083)] the authors sample uniformly at random from the set of proper vertex \(k\)-colourings of a graph. Two algorithms are considered: \textit{R. J. Glauber} dynamics [J.\ Math.\ Phys.\ 4, 294--307 (1963; Zbl 0145.24003)] and the WSK algorithm introduced by \textit{Wang, Swendsen} and \textit{Kotecký} [Phys.\ Rev.\ Lett.\ 63, 109--112 (1989) and Phys.\ Rev.\ B 42, 2465--2474 (1990)]. Such an algorithm is rapidly mixing if the mixing time of the Markov chain is polynomial in the number \(n\) of vertices, and torpidly mixing if it is exponential in \(n^{\epsilon}\) for some \(\epsilon>0\). There is an infinite family of 3-colourable planar graphs such that the WSK algorithm is torpidly mixing for every fixed \(k \geq 3\). There is a constant \(k_0\) and an infinite family of graphs with maximum degree \(\Delta\) such that the WSK algorithm is not ergodic for every \(k\) with \(k_0 \leq k \leq \Delta/2\). And there is an infinite family of bipartite graphs with maximum degree \(\Delta\) such that the WSK algorithm is torpidly mixing when \(3 \leq k < \Delta/(20\log\Delta)\).
0 references
randomized algorithm
0 references
Markov chain
0 references
Monte Carlo method
0 references
coloring
0 references
torpid mixing
0 references
0 references