University of Cambridge > Talks.cam > Cambridge Analysts' Knowledge Exchange > Percolation: the bunkbed conjecture on the complete graph

Percolation: the bunkbed conjecture on the complete graph

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Andrew Celsus.

In the percolation model, we start with a predetermined 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 look at a special case of the Bunkbed Conjecture; this is precisely such a statement. The talk is based on joint work (arXiv:1803.07647) with Peter van Hintum.

This talk is part of the Cambridge Analysts' Knowledge Exchange series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity