A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold (Q5506696)
From MaRDI portal
scientific article; zbMATH DE number 6662678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold |
scientific article; zbMATH DE number 6662678 |
Statements
A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold (English)
0 references
13 December 2016
0 references
random coloring
0 references
sparse random graph
0 references
efficient algorithm
0 references
0 references
