Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 7, 2023 | public
Journal Article

The bunkbed conjecture holds in the p ↑ 1 limit

Abstract

Let G = (V, E) be a countable graph. The Bunkbed graph of G is the product graph G x K₂, which has vertex set V x {0,1} with "horizontal" edges inherited from G and additional "vertical" edges connecting (w,0) and (w,1) for each w ϵ V. Kasteleyn's Bunkbed conjecture states that for each u, v ϵ V and p ϵ [0,1], the vertex (u,0) is at least as likely to be connected to (v,0) as to (v,1) under Bernoulli-p bond percolation on the bunkbed graph. We prove that the conjecture holds in the p ↑ 1 limit in the sense that for each finite graph G there exists ε(G) > 0 such that the bunkbed conjecture holds for p ⩾ 1 - ε(G).

Additional Information

This paper is the result of an undergraduate summer research project at the University of Cambridge in the summer of 2020, where PNN and AK were mentored by TH. PNN was supported jointly by a Trinity College Summer Studentship (F. J. Woods Fund) and a CMS Summer Studentship, AK was supported by a CMS Summer Research in Mathematics bursary, and TH was supported in part by ERC starting grant 804166 (SPRS). We thank Piet Lammers for helpful comments on a draft.

Additional details

Created:
August 22, 2023
Modified:
October 23, 2023