Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling
Sarat Moka, Ava Vahedi

TL;DR
This paper introduces a parallelizable algorithm for uniform sampling of proper graph colorings using soft relaxation and partial rejection sampling, improving efficiency over previous methods.
Contribution
It proposes a novel hybrid algorithm combining partial rejection sampling with decomposition, enabling faster exact sampling of graph colorings.
Findings
Improves sampling runtime for k>3Δ using existing CFTP methods.
Decomposition reduces problem size to O(log n), enhancing efficiency.
Simulation results support the conjecture of bounded relaxation levels, implying potential linear-time complexity.
Abstract
We present a new algorithm for the exact uniform sampling of proper \(k\)-colorings of a graph on \(n\) vertices with maximum degree~\(\Delta\). The algorithm is based on partial rejection sampling (PRS) and introduces a soft relaxation of the proper coloring constraint that is progressively tightened until an exact sample is obtained. Unlike coupling from the past (CFTP), the method is inherently parallelizable. We propose a hybrid variant that decomposes the global sampling problem into independent subproblems of size \(O(\log n)\), each solved by any existing exact sampler. This decomposition acts as a {\em complexity reducer}: it replaces the input size~\(n\) with \(O(\log n)\) in the component solver's runtime, so that any improvement in direct methods automatically yields a stronger result. Using an existing CFTP method as the component solver, this improves upon the best known…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
