Sampling Random Colorings of Sparse Random Graphs

SODA '18: Symposium on Discrete Algorithms New Orleans Louisiana January, 2018, pp. 1759-1771, 2018.

Cited by: 12|Bibtex|Views2|Links
EI

Abstract:

We study the mixing properties of the single-site Markov chain known as the Glauber dynamics for sampling k-colorings of a sparse random graph G(n, d/n) for constant d. The best known rapid mixing results for general graphs are in terms of the maximum degree Δ of the input graph G and hold when k > 11Δ/6 for all G. Improved results hold w...More

Code:

Data:

Your rating :
0

 

Tags
Comments