In discrete percolation theory, site percolation is a percolation model on a regular point lattice L = L^d in d-dimensional Euclidean space which considers the lattice vertices as the relevant entities. The precise mathematical construction for the Bernoulli version of site percolation is as follows. First, designate each vertex of L to be independently "open" with probability p element [0, 1] and closed otherwise. Next, define an open path to be any path in L all of whose vertices are open, and define at the vertex x element L the so-called open cluster C(x) to be the set of all vertices which may be attained following only open paths from x. Write C = C(0).