论文信息 - On Percolation and the Bunkbed Conjecture

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 | Svante Linusson

[1] T. E. Harris. A lower bound for the critical probability in a certain percolation process , 1960, Mathematical Proceedings of the Cambridge Philosophical Society.

[3] Geoffrey R. Grimmett,et al. Infinite paths in randomly oriented lattices , 2001, Random Struct. Algorithms.

[4] Colin McDiarmid. General percolation and random graphs , 1981, Advances in Applied Probability.

[5] A correlation inequality for connection events in percolation , 1999 .

[6] Olle Häggström. On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs , 1998, Comb. Probab. Comput..

[7] Svante Janson,et al. Correlations for paths in random orientations of G(n,p) and G(n,m) , 2009, Random Struct. Algorithms.

[8] A note on correlations in randomly oriented graphs , 2009, 0905.2881.

[9] Richard M. Karp,et al. The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[10] Béla Bollobás,et al. Random Walks and Electrical Resistances in Products of Graphs , 1997, Discret. Appl. Math..

[11] Svante Linusson,et al. A Counter-Intuitive Correlation in a Random Tournament , 2011, Comb. Probab. Comput..