| Mittagsseminar Talk Information | |
Date and Time: Thursday, November 13, 2008, 12:15 pm Duration: This information is not available in the database Location: CAB G51 Speaker: Dominik Scheder Bollobás' and Riordan's Proof of the Harris-Kesten Theorem
Consider the infinite two-dimensional integer grid, i.e. the graph
with the grid points Z2, and edges between any two
points of unit distance. Choose a random subgraph G by
including each edge of the grid with probability p,
independently of each other. The Harris-Kesten theorem states that
the probability that G contains an infinite connected
component is 0 for p ≤ 1/2 and 1 for p > 1/2. The
original proof is quite technical, but in 2006 the paper mentioned
below gives a short and beautiful proof of it.
Béla Bollobás and Oliver Riordan, A Short Proof of the Harris-Kesten Theorem,
Bull. London Math. Soc. v38. 470-484, 2006.
Upcoming talks | All previous talks | Talks by speaker |  Upcoming talks in iCal format (beta version!) Previous talks by year: 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.3392 | admin login
|
