Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 01, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Thomas Rast

Positive and negative correlation

On the positive correlation side, we discuss the FKG Theorem (Fortuin, Kasteleyn and Ginibre, 1971): under the (frequently easy to check) _positive lattice condition_, the seemingly much stronger _positive association property_ $E[fg] \le E[f]E[g]$ follows. We also give a proof outline based on a simplified version. On the negative correlation side, not nearly as much is known. We look at the example of uniform spanning trees, where negative correlation and in fact negative association is known to hold. Based on a survey of Pemantle (1999), we then give a brief overview of possible generalisations.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login