BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Percolation: the bunkbed conjecture on the complete graph - Piet L
 ammers
DTSTART:20180424T150000Z
DTEND:20180424T160000Z
UID:TALK105022@talks.cam.ac.uk
CONTACT:Andrew Celsus
DESCRIPTION:In the percolation model\, we start with a predetermined graph
 \, and flip a coin for every edge\; if the coin lands heads\, then the edg
 e is kept\, if tails\, the edge if removed. The coin need not be fair\, bu
 t the coin flips for different edges are independent. In percolation theor
 y\, one studies the resultant random graph. The model is simple to define 
 and has been studied extensively. However\, many statements about the rand
 om graph that seem very intuitive turn out to be hard to prove. We look at
  a special case of the Bunkbed Conjecture\; this is precisely such a state
 ment. The talk is based on joint work  (arXiv:1803.07647) with Peter van H
 intum.
LOCATION:MR14\, Centre for Mathematical Sciences
END:VEVENT
END:VCALENDAR