8 search results - page 1 / 2 » The Glauber Dynamics for Colourings of Bounded Degree Trees |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider Metropolis Glauber dynamics for sampling proper qcolourings of the n-vertex complete b-ary tree when 3 q b/2 ln(b). We give both upper and lower bounds on the mixing...
DMTCS
2006
13 years 4 months ago
2006
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...