Correlation Decay and Deterministic Approximation Algorithms

ACO Student Seminar
Tuesday, September 23, 2008 - 3:00pm
1 hour (actually 50 minutes)
ISyE executive classroom
School of Mathematics, Georgia Tech
The notion of a correlation decay, originating in statistical physics, has recently played an important role in yielding deterministic approximation algorithms for various counting problems. I will try to illustrate this technique with two examples: counting matchings in bounded degree graphs, and counting independent sets in certain subclasses of claw-free graphs.