On Percolation and the Bunkbed Conjecture

@article{Linusson2011OnPA,
  title={On Percolation and the Bunkbed Conjecture},
  author={Svante Linusson},
  journal={Combinatorics, Probability & Computing},
  year={2011},
  volume={20},
  pages={103-117}
}
We study a problem on edge percolation on product graphs G×K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is present with probability p independent of other edges. The Bunkbed conjecture states that for all G and p the probability that (u, 0) is in the same component as (v, 0) is greater than or equal to the probability that (u, 0) is in the same component as (v, 1) for every pair of vertices u, v ∈ G. We generalize this… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Proceedings of FPSAC’03

Olle Häggström, Probability on Bunkbed Graphs
Formal Power Series and Algebraic Combinatorics Linköping, Sweden • 2003

A lower bound for the critical probability in a certain percolation process

Theodore E. Harris
Proc. Cambridge Philos. Soc • 1960

Similar Papers

Loading similar papers…