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

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

• Prasad Tetali (Georgia Institute of Technology)
• Wednesday 11 May 2011, 14:30-15:30
• MR4.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR4
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.