Sciweavers

Share
CPC
2011

On Percolation and the Bunkbed Conjecture

8 years 6 months ago
On Percolation and the Bunkbed Conjecture
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 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.
Svante Linusson
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2011
Where CPC
Authors Svante Linusson
Comments (0)
books