The Setting
Finite graph connections are considered under Bernoulli product laws on all lattice variables. The graph that contains a connection and the region on which the opening parameter is prescribed are specified separately.
The cubic lattice consists of integer triples with coordinate indices .✦ Write for the unit vector in direction ; for a lattice vertex , the positive coordinate step in that direction is .✦ A lattice bond is a pair in , with endpoints and .✦ A bond is incident with lattice vertices when they are its two endpoints, in either order.✦
A percolation model is either the bond model or the site model.✦ The sets of variables of the bond and site models are and , respectively.✦ A percolation configuration for the model is a map from to , called a bond configuration for and a site configuration for ; state is open and state is closed.✦ A parameter field specifies the opening probabilities of the Bernoulli product law.
An internal variable of a region is a bond with both endpoints in in the bond model, or a vertex of in the site model.✦ The corresponding sets of variables are given by (1): (1)✦
For a graph with vertex set and a site configuration , open site adjacency is adjacency in with both vertices open.✦ Open site connectivity in is the relation on that holds when two vertices are connected by a finite path of open vertices; a path of length zero requires its vertex to be open.✦
The Definition
Definition 1. A finite lattice subgraph consists of a finite vertex set and finitely many lattice bonds whose endpoints belong to that set, as in (2): (2)✦ A vertex of is an element of .✦ The underlying graph of has vertex set , with and adjacent when some is incident with them.✦
For a bond configuration , open bond adjacency in is the relation that holds when some is incident with and satisfies .✦ Finite open bond connectivity in is the relation on that holds when and are connected by a finite path of open bond adjacencies in the configuration , possibly of length zero.✦ For a site configuration , finite open site connectivity is open site connectivity in the underlying graph of , with state at each .✦
For a chosen model and vertices , open percolation connectivity in is the relation specified by (3): (3)✦
The target connection event , for an origin and a target set , is the set of configurations in (4): (4)✦
A parameter field is uniform on a region with parameter when (5) holds: (5)✦
What Is Checked
The definitions concern finite lattice subgraphs under full lattice configurations, with a designated region and parameter fields valued in . The underlying graph has symmetric, loopless adjacency.