An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings

@article{Dyer2000AnEO,
  title={An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings},
  author={Martin E. Dyer and Leslie Ann Goldberg and Catherine S. Greenhill and Mark Jerrum and Michael Mitzenmacher},
  journal={SIAM J. Comput.},
  year={2000},
  volume={30},
  pages={1962-1975}
}
A new method for analyzing the mixing time of Markov chains is described. This method is an extension of path coupling and involves analyzing the coupling over multiple steps. The expected behavior of the coupling at a certain stopping time is used to bound the expected behavior of the coupling after a fixed number of steps. The new method is applied to analyze the mixing time of the Glauber dynamics for graph colorings. We show that the Glauber dynamics has O(n log(n)) mixing time for triangle… 

A general lower bound for mixing of single-site dynamics on graphs

  • Thomas P. HayesA. Sinclair
  • Mathematics, Computer Science
    46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least /spl Omega/(n log n), where it is the

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

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∆.

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

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Δ.

Path Coupling Using Stopping Times

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Δ.

Systematic scan for sampling colorings

We address the problem of sampling colorings of a graph $G$ by Markov chain simulation. For most of the article we restrict attention to proper $q$-colorings of a path on $n$ vertices (in statistical

Linear Programming Bounds for Randomly Sampling Colorings

It turns out that there is a natural barrier at $\frac{11}{6}$, below which there is no one-step coupling that is contractive, even for the flip dynamics, and this is the first improvement to Vigoda's analysis that holds for general graphs.

The Glauber dynamics on colourings of a graph with high girth and maximum degree

(MATH) We prove that the Glauber dynamics on the C-colourings of a graph G on n vertices with girth g and maximum degree $\D$ mixes rapidly if (i) $C=q\D$ and $q>q^*$ where $q^*=1.4890... $ is the

University of Birmingham Improved bounds for randomly sampling colorings via linear programming

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of k -colorings of a graph G on n vertices with maximum degree ∆ is rapidly mixing for k ≥ ∆ +

Linear Programming Bounds for Randomly Sampling

Here we study the problem of sampling random proper colorings of a bounded degree graph. Let k be the number of colors and let d be the maximum degree. In 1999, Vigoda [Vig99] showed that the Glauber

Variable length path coupling

The authors' main theorem is a generalization of the path coupling theorem of Bubley and Dyer, allowing the defining partial couplings to have length determined by a random stopping time, and can produce multi-step (non-Markovian) couplings.

References

SHOWING 1-10 OF 27 REFERENCES

On Approximately Counting Colorings of Small Degree Graphs

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

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

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.

COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS

By symmetry, P has eigenvalues 1 = I03 > I381 > ?> I 31xI- 1 2 -1. This paper develops methods for getting upper and lower bounds on 8i3 by comparison with a second reversible chain on the same state

Mixing times

It turns out that there are many ways to deene mixing time, but they fall into a small number of classes, which lie within constant multiples of one another, independent of the chain.

Analyzing Glauber Dynamics by Comparison of Markov Chains

A popular technique for studying random properties of a combinatorial set is to design a Markov chain Monte Carlo algorithm, but recently there has been progress in analyzing these more complicated algorithms for several important combinatorsial problems.

Markov chains, computer proofs, and average-case analysis of best fit bin packing

A computer-aided approach to the analysis of higher-dimensional domains, using several open problems about the average-case behavior of the Best Fit bin packing algorithm as case studies and answering yes to the long-standing open question of whether there exist distributions of thii form for which Best Fit yields linearly-growing waste.

LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS

This is an expository paper on the use of logarithmic Sobolev inequalities for bounding rates of convergence of Markov chains on finite state spaces to their stationary distributions. Logarithmic

Surveys in Combinatorics, 1999: Random Walks on Combinatorial Objects

Approximate sampling from combinatorially-defined sets, using the Markov chain Monte Carlo method, is discussed from the perspective of combinatorial algorithms. We also examine the associated

Efficient stopping rules for Markov chains

A stopping rule is given which runs in time polynomial in the maximum hitting time of Al and achieves the stationary distribution exactly, even though the transition probabilities of the chain are unknown.