Improved bounds for randomly sampling colorings via linear programming
Copyright © 2019 by SIAM. A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of k-colorings of a graph G on n vertices with maximum degree ∆ is rapidly mixing for k ≥ ∆ + 2. In FOCS 1999, Vigoda [43] showed that the flip dynamics (and therefore al...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2021-11-09T19:22:09Z.
|
| Subjects: | |
| Online Access: | Get fulltext |