Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950813 | Information Processing Letters | 2017 | 4 Pages |
Abstract
We study the problem of constructing a (near) uniform random proper q-coloring of a simple k-uniform hypergraph with n vertices and maximum degree Î. (Proper in that no edge is mono-colored and simple in that two edges have maximum intersection of size one.) We show that if qâ¥maxâ¡{Cklogâ¡n,500k3Î1/(kâ1)} then the Glauber Dynamics will become close to uniform in O(nlogâ¡n) time, given a random (improper) start. This improves on the results in Frieze and Melsted [5].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alan Frieze, Michael Anastos,