On percolation and the bunkbed conjecture

Details On percolation and the bunkbed conjecture On percolation and the bunkbed conjecture

2008-11-06

arxiv.org/abs/0811.0949v2

Mathematics

Combinatorics

13 pages, improved exposition thanks to anonymous referee. To appear in CPC

Scientific paper

We study a problem on edge percolation on product graphs $G\times K_2$. Here $G$ is any finite graph and $K_2$ consists of two vertices $\{0,1\}$ connected by an edge. Every edge in $G\times K_2$ 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\in 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.

Affiliated with

Also associated with

No associations

Rating

On percolation and the bunkbed conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On percolation and the bunkbed conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On percolation and the bunkbed conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-630765