A more rapidly mixing Markov chain for graph colorings

@article{Dyer1998AMR,
  title={A more rapidly mixing Markov chain for graph colorings},
  author={Martin E. Dyer and Catherine S. Greenhill},
  journal={Random Struct. Algorithms},
  year={1998},
  volume={13},
  pages={285-317}
}
We define a new Markov chain on (proper) k-colorings of graphs, and relate its convergence properties to the maximum degree Δ of the graph. The chain is shown to have bounds on convergence time appreciably better than those for the well-known Jerrum/Salas–Sokal chain in most circumstances. For the case k=2Δ, we provide a dramatic decrease in running time. We also show improvements whenever the graph is regular, or fewer than 3Δ colors are used. The results are established using the method of… 

Very rapidly mixing Markov Chains for 2D-colorings and for independent sets in a graph with maximum degree 4

We introduce a new technique for analyzing the mixing rate of Markov chains. We use it to prove that the Glauber dynamics on 2Δ-colorings of a graph with maximum degree Δ mixes in O(n log n) time. We

Path coupling using stopping times and counting independent sets and colorings in hypergraphs

TLDR
It is shown that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree ∆ of a vertex and the minimum size m of an edge satisfy m ≥ 2∆+1.65∆.

On Approximately Counting Colorings of Small Degree Graphs

TLDR
A computer-assisted proof technique is used to establish rapid mixing of a new "heat bath" Markov chain on colorings using the method of path coupling and gives a general proof that the problem of exactly counting the number of proper k-colorings of graphs with maximum degree $\Delta$ is complete.

Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs

TLDR
This paper extends both results to prove that the Glauber dynamics has optimal mixing time when the graph has maximum degree Δ and the number of colors is a small constant fraction smaller than 2Δ.

On Sampling Colorings of Bipartite Graphs

TLDR
It is shown that a class of markov chains cannot be used as efficient samplers and these negative results hold true for H-colorings of bipartite graphs provided H contains a spanning complete bipartites subgraph.

Beating the 2Δ bound for approximately counting colourings: a computer-assisted proof of rapid mixing

TLDR
This work proposes a novel computer-assisted proof technique to establish rapid mixing of a new “heat bath” Markov chain on colourings using the method of path coupling and outlines an extension to 7-colourings of triangle-free 4-regular graphs.

Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs

TLDR
A new version of the decomposition theorem is presented where the pieces partition the state space, rather than forming a cover where pieces overlap, as was previously required, which is more natural and better suited to many applications.

A Markov Chain Algorithm for Eulerian Orientations of Planar Triangular Graphs

On the set of Eulerian orientations of a planar Eulerian graph a natural Markov chain is defined and is shown to converge to the uniform distribution. For the class of planar triangular graphs this

Sampling Grid Colorings with Fewer Colors

TLDR
An optimally mixing Markov chain for 6-colorings of the square grid is provided, which implies that the uniform distribution on the set of such colorings has strong spatial mixing.
...

References

SHOWING 1-10 OF 18 REFERENCES

On Approximately Counting Colorings of Small Degree Graphs

TLDR
A computer-assisted proof technique is used to establish rapid mixing of a new "heat bath" Markov chain on colorings using the method of path coupling and gives a general proof that the problem of exactly counting the number of proper k-colorings of graphs with maximum degree $\Delta$ is complete.

Beating the 2Δ bound for approximately counting colourings: a computer-assisted proof of rapid mixing

TLDR
This work proposes a novel computer-assisted proof technique to establish rapid mixing of a new “heat bath” Markov chain on colourings using the method of path coupling and outlines an extension to 7-colourings of triangle-free 4-regular graphs.

On Markov Chains for Independent Sets

TLDR
A new rapidly mixing Markov chain for independent sets is defined and a polynomial upper bound for the mixing time of the new chain is obtained for a certain range of values of the parameter ?, which is wider than the range for which the mixingTime of the Luby?Vigoda chain is known to be polynomially bounded.

Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract).

TLDR
This paper presents techniques which prove for the first time that, in many interesting cases, a small number of random moves suffice to obtain a uniform distribution.

Faster random generation of linear extensions

A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph

  • M. Jerrum
  • Mathematics
    Random Struct. Algorithms
  • 1995
A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) k‐colorings of a graph of maximum degree Δ, when k ≥ 2Δ + 1. © 1995 John Wiley & Sons, Inc.

Random walks on finite groups and rapidly mixing markov chains

© Springer-Verlag, Berlin Heidelberg New York, 1983, tous droits reserves. L’acces aux archives du seminaire de probabilites (Strasbourg) (http://www-irma. u-strasbg.fr/irma/semproba/index.shtml),

The Markov chain Monte Carlo method: an approach to approximate counting and integration

TLDR
The introduction of analytical tools with the aim of permitting the analysis of Monte Carlo algorithms for classical problems in statistical physics has spurred the development of new approximation algorithms for a wider class of problems in combinatorial enumeration and optimization.

Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem

We prove that theq-state Potts antiferromagnet on a lattice of maximum coordination numberr exhibits exponential decay of correlations uniformly at all temperatures (including zero temperature)

A Linear Algorithm For Generating Random Numbers With a Given Distribution

  • M. Vose
  • Computer Science
    IEEE Trans. Software Eng.
  • 1991
TLDR
Improvements to a fast method of generating sample values for xi in constant time are suggested, which reduces the time required for initialization to O(n).