4 search results - page 1 / 1 » A Non-Markovian Coupling for Randomly Sampling Colorings |
FOCS
2003
IEEE
14 years 8 days 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...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
ICIC
2005
Springer
14 years 15 days ago
2005
Springer
Rather than the difficulties of highly non-linear and non-Gaussian observation process and the state distribution in single target tracking, the presence of a large, varying number...