BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Cambridge Analysts' Knowledge Exchange
SUMMARY:Percolation: the bunkbed conjecture on the complet
e graph - Piet Lammers
DTSTART;TZID=Europe/London:20180424T160000
DTEND;TZID=Europe/London:20180424T170000
UID:TALK105022AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/105022
DESCRIPTION:In the percolation model\, we start with a predete
rmined graph\, and flip a coin for every edge\; if
the coin lands heads\, then the edge is kept\, if
tails\, the edge if removed. The coin need not be
fair\, but the coin flips for different edges are
independent. In percolation theory\, one studies
the resultant random graph. The model is simple to
define and has been studied extensively. However\
, many statements about the random graph that seem
very intuitive turn out to be hard to prove. We l
ook at a special case of the Bunkbed Conjecture\;
this is precisely such a statement. The talk is ba
sed on joint work (arXiv:1803.07647) with Peter v
an Hintum.
LOCATION:MR14\, Centre for Mathematical Sciences
CONTACT:Andrew Celsus
END:VEVENT
END:VCALENDAR