We consider the problem of uniformly sampling proper 3-colorings of an m X n rectangular region of Z(2). We show that the single-site "Glauber-dynamics" Markov chain is rapidly mixing. Our result complements an earlier result of Luby, Randall, and Sinclair, which demonstrates rapid mixing when there is a fixed boundary (whose color cannot be changed). (C) 2004 Wiley Periodicals, Inc
http://www.springerlink.com/content/hxn3ubgp4q7yp51j/ The original publication can be found at www...
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of...
AbstractWe study the problem of sampling uniformly at random from the set of k-colorings of a graph ...
We study Markov chains for randomly sampling k-colorings of a graph with maximum degree Δ. Our main ...
We study the mixing properties of the single-site Markov chain known as the Glauber dynamics for sam...
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colo...
We study the problem of efficiently sampling k-colorings of bipartite graphs. We show that a class o...
We show that if Σ = (V,E) is a regular bipartite graph for which the ex-pansion of subsets of a sing...
AbstractWe study the problem of sampling uniformly at random from the set of k-colorings of a graph ...
A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the ...
Copyright © 2019 by SIAM. A well-known conjecture in computer science and statistical physics is tha...
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional d...
Graph colouring is arguably one of the most important issues in Graph Theory. However, many of the q...
http://www.springerlink.com/content/hxn3ubgp4q7yp51j/ The original publication can be found at www...
We address the problem of sampling colorings of a graph G by Markov chain simulation. For most of th...
http://www.springerlink.com/content/hxn3ubgp4q7yp51j/ The original publication can be found at www...
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of...
AbstractWe study the problem of sampling uniformly at random from the set of k-colorings of a graph ...
We study Markov chains for randomly sampling k-colorings of a graph with maximum degree Δ. Our main ...
We study the mixing properties of the single-site Markov chain known as the Glauber dynamics for sam...
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colo...
We study the problem of efficiently sampling k-colorings of bipartite graphs. We show that a class o...
We show that if Σ = (V,E) is a regular bipartite graph for which the ex-pansion of subsets of a sing...
AbstractWe study the problem of sampling uniformly at random from the set of k-colorings of a graph ...
A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the ...
Copyright © 2019 by SIAM. A well-known conjecture in computer science and statistical physics is tha...
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional d...
Graph colouring is arguably one of the most important issues in Graph Theory. However, many of the q...
http://www.springerlink.com/content/hxn3ubgp4q7yp51j/ The original publication can be found at www...
We address the problem of sampling colorings of a graph G by Markov chain simulation. For most of th...
http://www.springerlink.com/content/hxn3ubgp4q7yp51j/ The original publication can be found at www...
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of...
AbstractWe study the problem of sampling uniformly at random from the set of k-colorings of a graph ...