Critical Percolation Probabilities for the Next-Nearest-Neighbouring Site Problems on Sierpinski Carpets

In this paper, we compute the next-nearest-neighbouring site percolation (Connections exist not only between nearest-neighbouring sites, but also between next-nearest-neigh bouring sites.) probabilities PC on the two-dimensional Sierpinski carpets, using the translationaldilation method and Monte Carlo technique. We obtain a relation among PC, fractal dimensionality D and connectivity Q. For the family of carpets with central cutouts,(1 - P_c)/(1 - P_c^s) = (D - 1)^1.60, where P_c^s = 0.41, the critical percolation probability for the next-nearest-neighbouring site problem on square lattice. As D reaches 2, P_c = P_c^s = 0.41, which is in agreement with the critical percolation probability on 2-d square lattices with . next-nearest-neigh bouring interactions.