Strong spatial mixing for list coloring of graphs

Strong spatial mixing for list coloring of graphs

David Gamarnik Operations Research Center and Sloan School of Management, MIT, Cambridge, MA, 02139, e-mail: gamarnik@mit.edu    Dmitry Katz T.J. Watson Research Center, IBM, Yorktown Heights, NY, 10598, e-mail:dimdim@mit.edu    Sidhant Misra Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 02139, e-mail: sidhant@mit.edu
Abstract

The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise known to be hard. In the context of coloring, strong spatial mixing has been established for regular trees in [GeStefankovic11] when where the number of colors, is the degree and is the unique solution to . It has also been established in [GoldbergMartinPaterson05] for bounded degree lattice graphs whenever for some constant , where is the maximum vertex degree of the graph. The latter uses a technique based on recursively constructed coupling of Markov chains whereas the former is based on establishing decay of correlations on the tree. We establish strong spatial mixing of list colorings on arbitrary bounded degree triangle-free graphs whenever the size of the list of each vertex is at least where is the degree of vertex and and is a constant that only depends on . We do this by proving the decay of correlations via recursive contraction of the distance between the marginals measured with respect to a suitably chosen error function.

Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
27170
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description