2015/10/06 by Briceño, Raimundo, Pavlov, Ronnie · 1 citation
#68R10 #82B20 #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Probability (math.PR)
paper · doi:10.48550/arxiv.1510.01453
Given a countable graph G and a finite graph H, we consider Hom(G,H) the set of graph homomorphisms from G to H and we study Gibbs measures supported on Hom(G,H) . We develop some sufficient and other necessary conditions on Hom(G,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 H has a combinatorial property called dismantlability if and only if for every 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.