Sciweavers

3 search results - page 1 / 1
» Rapid mixing of Gibbs sampling on graphs that are sparse on ...
Sort
View
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 7 months ago
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
Elchanan Mossel, Allan Sly
FOCS
2006
IEEE
14 years 9 days ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
13 years 6 months ago
On randomly colouring locally sparse graphs
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...
Alan M. Frieze, Juan Vera