The Setting
The exploration concerns origin connections through cubes of , indexed by the coarse lattice . Its decisions depend on the percolation variables already observed and on conditional probabilities for cubes awaiting inspection.
Fix a bond or site model and an integer scale . The variable set of the percolation model is the set of lattice bonds in the bond model and the set of lattice vertices in the site model.✦ A configuration assigns closed or open states, respectively.✦ A lattice bond has endpoints and , where is a positive coordinate unit vector; incidence with two vertices disregards their order.
A lattice box has coordinatewise ordered corners.✦ Its vertex set is ✦, and its bonds are those with both endpoints in .✦ For and a nonnegative integer radius , the cube is the lattice box with corners and coordinatewise.✦ For a coarse vertex , the center and the two associated cubes are (1). (1) The four coarse directions have outward vectors , , and .✦
Finite Connections and Revealed Variables
A finite lattice subgraph consists of finite vertex and bond sets with both endpoints of every edge in .✦ The underlying simple graph of a finite lattice subgraph is the graph on in which two vertices are adjacent when they are incident to an edge of .✦ Open bond adjacency in a finite lattice subgraph is the relation between two vertices that are incident to an open edge of . Open site adjacency requires adjacent vertices to be open.✦ Write for connectivity by a finite open path in under and the configuration in question.✦ A bond path may have length zero; a site path requires every vertex, including both endpoints, to be open even at length zero. A target connection means for some .✦
The box graph has vertex set and edge set .✦ Containment means and .✦ The percolation variables of are in the bond model and in the site model✦; write for a box.
The interface is the set of lattice bonds with one endpoint in and the other in .✦ The interbox variables between the cubes and form the set in the bond model and the empty set in the site model.✦ For coarse vertices and a finite coarse set , the block variables , root variables and processed region variables are the finite sets in (2). (2)
For a finite lattice subgraph and coarse vertices with , the graph extension is the finite lattice graph obtained by adding the box and its interface with , as specified in (3). (3)✦
The Definition
Definition 1. A finite observation history for is a pair as in (4), where is the set of recorded variables and is a configuration. (4)✦ For a finite set and configurations and , the partial replacement is the configuration taking the value on and outside . Observing extends the history by (5). (5)✦
For opening probabilities , the independent Bernoulli law and the parameters pinned by are given in (6). For constant opening probability , write for the history-conditioned law in that display. (6)
An exploration packet at scale is a triple in (7): is its coarse vertex, its parent, and its finite lattice graph. (7)✦ The packet connection event is the event in (8). (8)✦ The root packet and the child packet at a coarse vertex are (9). (9)
An exploration state is the tuple in (10), with history , processed vertices , an ordered packet queue , good vertices and bad vertices . (10)✦ The visited set of an exploration state is the set of its processed and queued coarse vertices. The unrevealed variables of the first queued block and the history after their observation are defined by (11); and denote the vertex and parent of a packet , denotes the empty queue, and denotes the queue with first packet and remaining queue . (11) For a packet , the candidate list in (12) consists of its unvisited neighboring children, ordered by direction. (12)✦
For , , an exploration state , a packet and a configuration , the acceptance criterion is the condition in (13). (13)✦ Write for list concatenation. The exploration successor after processing the first packet is (14), where in the two nonempty queue cases. (14)✦
A valid exploration state at parameters is an exploration state satisfying (15), whose final condition is the pending connection promise; denotes the graph of packet . (15)✦ The initial state is (16), where is the all-open configuration. (16)✦
What Is Checked
The setting is defined for either percolation model on at every integer scale , with and , and uses finite lattice subgraphs with finite observation histories.