The bunkbed conjecture on the complete graph
From MaRDI portal
Abstract: The bunkbed conjecture was first posed by Kasteleyn. If is a finite graph and some subset of , then the bunkbed of the pair is the graph plus extra edges to connect for every the vertices and . The conjecture asserts that is more likely to connect with than with in the independent bond percolation model for any . This is intuitive because is in some sense closer to than it is to . The conjecture has however resisted several attempts of proof. This paper settles the conjecture in the case of a constant percolation parameter and the complete graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 1921295 (Why is no real title available?)
- A correlation inequality for connection events in percolation
- General percolation and random graphs
- On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs
- On percolation and the bunkbed conjecture
- Probability on graphs. Random processes on graphs and lattices.
- Random walks and electrical resistances in products of graphs
- The transitive closure of a random digraph
Cited in
(5)
This page was built for publication: The bunkbed conjecture on the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633616)