A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold

SIAM J. Comput., Volume 45, Issue 6, 2016, Pages 2087-2116.

Cited by: 0|Bibtex|Views1|Links
EI

Abstract:

Approximate random $k$-coloring of a graph $G$ is a well-studied problem in computer science and statistical physics. It amounts to constructing a $k$-coloring of $G$ which is distributed close to the Gibbs distribution in polynomial time. Here, we deal with the problem when the underlying graph is an instance of the Erdos--Renyi random g...More

Code:

Data:

Your rating :
0

 

Tags
Comments