University of Cambridge > Talks.cam > Combinatorics Seminar > New Bounds for the hard-core model on the square lattice

New Bounds for the hard-core model on the square lattice

Add to your list(s) Download to your calendar using vCal

  • UserPrasad Tetali (Georgia Institute of Technology)
  • ClockWednesday 11 May 2011, 14:30-15:30
  • HouseMR4.

If you have a question about this talk, please contact Andrew Thomason.

The hard-core model is a weighted independent set model on graphs of much interest in combinatorics, stochastic networks, statistical mechanics and theoretical computer science. We focus on the well-studied particular case of the square lattice $Z^2$, and provide a new lower bound for the uniqueness threshold. Our technique refines and builds on the tree of self-avoiding walks approach of Dror Weitz (2006) for establishing strong spatial mixing (and hence uniqueness). Our results also imply a fully polynomial deterministic approximation algorithm for approximating the partition function and rapid mixing of the associated Glauber dynamics.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity