A d-dimensional discrete percolation model on a regular point lattice L = L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the so-called north-east oriented lattice L^⇀ obtained by orienting each edge of an arbitrary (perhaps unoriented) point lattice L in the direction of increasing coordinate-value. The above figure shows an example of a subset of a 2-dimensional oriented percolation model on the north-east lattice. Here, each edge has been deleted with probability 1 - p for some 0<=p<=1, independently of all other edges.

AB percolation | Bernoulli percolation model | bond percolation | Boolean model | Boolean-Poisson model | bootstrap percolation | Cayley tree | cluster | cluster perimeter | continuum percolation theory | dependent percolation | discrete percolation theory | disk model | first-passage percolation | germ-grain model | inhomogeneous percolation model | lattice animal | long-range percolation model | mixed percolation model | percolation | percolation theory | percolation threshold | polyomino | random-cluster model | random-connection model | random walk | s-cluster | site percolation | s-run