Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant

@article{Sinclair2013SpatialMA,
  title={Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant},
  author={Alistair Sinclair and Piyush Srivastava and Yitong Yin},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={300-309}
}
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to λ|I|, where λ > 0 is the vertex activity. We show that there is an intimate connection between the connective constant of a graph and the phenomenon of strong spatial mixing (decay of… CONTINUE READING