The percolation is simulated on 3D square lattice with uniformly weighted sites and the constant parameters p0, p1, and p2.
The isotropic cluster is formed from the accessible sites connected with initial sites subset set.
Moore (1,d)-neighborhood on 3D square lattice consists of sites, at least one coordinate of which is different from the current site by one: e=c(e0,e1,e2), where
e0=c(-1, 1, -x, x, -x^2, x^2);
e1=colSums(matrix(e0[c(1,3, 2,3, 1,4, 2,4, 1,5, 2,5, 1,6, 2,6, 3,5, 4,5, 3,6, 4,6)], nrow=2));
e2=colMeans(matrix(p0[c(1,3,5, 2,3,5, 1,4,5, 2,4,5, 1,3,6, 2,3,6, 1,4,6, 2,4,6)], nrow=3)).
Minkowski distance between sites a and b depends on the exponent d:
rhoM <- function(a, b, d=1)
if (is.infinite(d)) return(apply(abs(b-a), 2, max))
else return(apply(abs(b-a)^d, 2, sum)^(1/d)).
Minkowski distance for sites from e1 and e2 subsets with the exponent d=1 is equal to rhoMe1=2 and rhoMe2=3.
Each element of the matrix frq is equal to the relative frequency with which the 3D square lattice site belongs to a cluster sample of size n.