Strong Spatial Mixing in Homomorphism Spaces

Given a countable graph $\mathcal{G}$ and a finite graph $\mathrm{H}$, we consider $\mathrm{Hom}(\mathcal{G},\mathrm{H})$ the set of graph homomorphisms from $\mathcal{G}$ to $\mathrm{H}$ and we study Gibbs measures supported on $\mathrm{Hom}(\mathcal{G},\mathrm{H})$ . We develop some sufficient and other necessary conditions on $\mathrm{Hom}(\mathcal{G},\mathrm{H})$ for the existence of Gibbs specifications satisfying strong spatial mixing (with exponential decay rate). We relate this with previous work of Brightwell and Winkler, who showed that a graph $\mathrm{H}$ has a combinatorial property called dismantlability if and only if for every $\mathcal{G}$ of bounded degree, there exists a Gibbs specification with unique Gibbs measure. We strengthen their result by showing that this unique Gibbs measure can be chosen to have weak spatial mixing, but we also show that there exist dismantlable graphs for which no Gibbs measure has strong spatial mixing.

[1]  Van den Berg,et al.  Disagreement percolation in the study of Markov fields , 1994 .

[2]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

[3]  Ronnie Pavlov,et al.  Representation and Poly-time Approximation for Pressure of Z 2 Lattice Models in the Non-uniqueness Region , 2015 .

[4]  Brian H. Marcus,et al.  Computing Bounds for Entropy of Stationary Zd Markov Random Fields , 2012, SIAM J. Discret. Math..

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

[6]  Peter Winkler,et al.  Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[7]  Graham R. Brightwell,et al.  Graph Homomorphisms and Phase Transitions , 1999, J. Comb. Theory, Ser. B.

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

[9]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[10]  M. Lewin.  On nonnegative matrices , 1971 .

[11]  J. Berg,et al.  A new lower bound for the critical probability of site percolation on the square lattice , 1996 .

[12]  D. Gamarnik,et al.  Sequential Cavity Method for Computing Free Energy and Surface Pressure , 2008, 0807.1551.

[13]  Martin E. Dyer,et al.  Mixing in time and space for lattice spin systems: A combinatorial view , 2002, RANDOM.

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

[15]  B. Marcus,et al.  Representation and Poly-time Approximation for Pressure of $$\mathbb {Z}^2$$Z2 Lattice Models in the Non-uniqueness Region , 2015, 1508.06590.

[16]  Dmitriy Katz,et al.  Correlation decay and deterministic FPTAS for counting list-colorings of a graph , 2007, SODA '07.

[17]  David Gamarnik,et al.  Counting without sampling: Asymptotics of the log‐partition function for certain statistical physics models , 2008, Random Struct. Algorithms.

[18]  B. Marcus,et al.  One-dimensional Markov random fields, Markov chains and topological Markov fields , 2011, 1112.4240.

[19]  Peter Winkler,et al.  Gibbs Measures and Dismantlable Graphs , 2000, J. Comb. Theory, Ser. B.

[20]  B. Marcus,et al.  An integral representation for topological pressure in terms of conditional probabilities , 2013, 1309.1873.

[21]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[22]  Dror Weitz.  Combinatorial criteria for uniqueness of Gibbs measures , 2005 .

[23]  F. Martinelli,et al.  For 2-D lattice spin systems weak mixing implies strong mixing , 1994 .

[24]  R. Dobrushin.  The problem of uniqueness of a gibbsian random field and the problem of phase transitions , 1968 .

[25]  Leslie Ann Goldberg,et al.  Improved mixing bounds for the anti-ferromagnetic Potts model on Z^2 , 2005 .

[26]  R. Briceño.  The topological strong spatial mixing property and new conditions for pressure approximation , 2014, Ergodic Theory and Dynamical Systems.