Learn More

Let Z 2 cp be the close-packed graph of Z 2 , that is, the graph obtained by adding to each face of Z 2 its diagonal edges. We consider site percolation on Z 2 cp , namely, for each v we choose X(v) = 1 or 0 with probability p or 1 − p, respectively, independently for all vertices v of Z 2 cp. We say that a word (ξ 1 , ξ 2 ,. . .) ∈ {0, 1} N is seen in the… (More)

- ‹
- 1
- ›