Improved Strong Spatial Mixing for Colorings on Trees

Strong spatial mixing (SSM) is a form of correlation decay that has played an essential role in the design of approximate counting algorithms for spin systems. A notable example is the algorithm of Weitz (2006) for the hard-core model on weighted independent sets. We study SSM for the $q$-colorings problem on the infinite $(d+1)$-regular tree. Weak spatial mixing (WSM) captures whether the influence of the leaves on the root vanishes as the height of the tree grows. Jonasson (2002) established WSM when $q>d+1$. In contrast, in SSM, we first fix a coloring on a subset of internal vertices, and we again ask if the influence of the leaves on the root is vanishing. It was known that SSM holds on the $(d+1)$-regular tree when $q>\alpha d$ where $\alpha\approx 1.763...$ is a constant that has arisen in a variety of results concerning random colorings. Here we improve on this bound by showing SSM for $q>1.59d$. Our proof establishes an $L^2$ contraction for the BP operator. For the contraction we bound the norm of the BP Jacobian by exploiting combinatorial properties of the coloring of the tree.

[1]  Randomly Coloring Constant Degree Graphs , 2004, FOCS.

[2]  Liang Li,et al.  Correlation Decay up to Uniqueness in Spin Systems , 2013, SODA.

[3]  Leslie Ann Goldberg,et al.  Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree , 2018, ArXiv.

[4]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[5]  Alistair Sinclair,et al.  Random-cluster dynamics in $${{\mathrm{\mathbb {Z}}}}^2$$Z2 , 2017 .

[6]  Martin E. Dyer,et al.  Randomly coloring graphs with lower bounds on girth and maximum degree , 2003, Random Struct. Algorithms.

[7]  Piyush Srivastava,et al.  A Deterministic Algorithm for Counting Colorings with 2-Delta Colors , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[8]  Piyush Srivastava,et al.  A deterministic algorithm for counting colorings with 2Δ colors , 2019, ArXiv.

[9]  Leslie Ann Goldberg,et al.  Strong Spatial Mixing with Fewer Colors for Lattice Graphs , 2005, SIAM J. Comput..

[10]  G. Brightwell,et al.  Random colorings of a cayley tree , 2002 .

[11]  Thomas P. Hayes.  Local uniformity properties for glauber dynamics on graph colorings , 2013, Random Struct. Algorithms.

[12]  V. Beara.  The self-dual point of the two-dimensional random-cluster model is critical for q > 1 , 2011 .

[13]  F. Cesi.  Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields , 2001 .

[14]  J. Jonasson.  Uniqueness of uniform random colorings of regular trees , 2002 .

[15]  Judea Pearl,et al.  Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach , 1982, AAAI.

[16]  Eric Vigoda,et al.  Spatial mixing and nonlocal Markov chains , 2017, SODA.

[17]  Charilaos Efthymiou.  A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold , 2016, SIAM J. Comput..

[18]  Dror Weitz,et al.  Counting independent sets up to the tree threshold , 2006, STOC '06.

[19]  Alexander I. Barvinok,et al.  Combinatorics and Complexity of Partition Functions , 2017, Algorithms and combinatorics.

[20]  Daniel Stefankovic,et al.  Strong spatial mixing of $q$-colorings on Bethe lattices , 2011 .

[21]  Dmitriy Katz,et al.  Strong spatial mixing of list coloring of graphs , 2012, Random Struct. Algorithms.

[22]  Han Peters,et al.  On a conjecture of Sokal concerning roots of the independence polynomial , 2017, Michigan Mathematical Journal.

[23]  F. Martinelli,et al.  Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .

[24]  F. Martinelli,et al.  Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .

[25]  Martin E. Dyer,et al.  Mixing in time and space for lattice spin systems: A combinatorial view , 2002, International Workshop Randomization and Approximation Techniques in Computer Science.