On Percolation and the Bunkbed Conjecture

From MaRDI portal
Publication:3068816

DOI10.1017/S0963548309990666zbMATH Open1298.05278arXiv0811.0949OpenAlexW2068525708WikidataQ123334337 ScholiaQ123334337MaRDI QIDQ3068816FDOQ3068816

Svante Linusson

Publication date: 17 January 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: We study a problem on edge percolation on product graphs GimesK2. Here G is any finite graph and K2 consists of two vertices 0,1 connected by an edge. Every edge in GimesK2 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,vinG. We generalize this conjecture and formulate and prove similar statements for randomly directed graphs. The methods lead to a proof of the original conjecture for special classes of graphs G, in particular outerplanar graphs.


Full work available at URL: https://arxiv.org/abs/0811.0949





Cites Work


Cited In (5)






This page was built for publication: On Percolation and the Bunkbed Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068816)