Randomly coloring sparse random graphs with fewer colors than the maximum degree
Random Structures & Algorithms
Randomly coloring planar graphs with fewer colors than the maximum degree
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the problem of generating a coloring of the random graph 𝔾n,p uniformly at random using a natural Markov chain algorithm: the Glauber dynamics. We assume that there are βΔ colors available, where Δ is the maximum degree of the graph, and we wish to determine the least β = β(p) such that the distribution is close to uniform in O(n log n) steps of the chain. This problem has been previously studied for 𝔾n,p in cases where np is relatively small. Here we consider the “dense” cases, where np ε [ω ln n, n] and ω = ω(n) → ∞. Our methods are closely tailored to the random graph setting, but we obtain considerably better bounds on β(p) than can be achieved using more general techniques. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009