Duality in percolation via outermost boundaries I: Bond Percolation

Abstract: Tile (\mathbb{R}^2) into disjoint unit squares ({S_k}_{k \geq 0}) with the origin being the centre of (S_0) and say that (S_i) and (S_j) are star adjacent if they share a corner and plus adjacent if they share an edge. Every square is either vacant or occupied. Outermost boundaries of finite star and plus connected components frequently arise in the context of contour analysis in percolation and random graphs. In this paper, we derive the outermost boundaries for finite star and plus connected components using a piecewise cycle merging algorithm. For plus connected components, the outermost boundary is a single cycle and for star connected components, we obtain that the outermost boundary is a connected union of cycles with mutually disjoint interiors. As an application, we use the outermost boundaries to give an alternate proof of mutual exclusivity of left right and top bottom crossings in oriented and unoriented bond percolation.