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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

SPECIAL LOCATION - CMS, MR12, Pav. D basement Centre of Governance and Human Rights Events MR11 (Malcolm Room), Pavilion B, DAMTP, CMS

Other talks

Online Causal Inference Seminar Geometry and Generalization: The case of Grokking Title TBC The search for a new population of strong gravitational lenses with JWST Cambridge RNA Club - ONLINE Discussion I
 

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