Clustering in some randomly occupied two- and three-dimensional lattices

Abstract

Clustering in some two- and three-dimensional lattices is investigated using an algorithm similar to that of Hoshen–Kopelman. The total number of clusters reveals a maximum at an occupation probability, pmax, where the average cluster size, 2.03 ± 0.07, is found to be independent of the size, dimension, coordination number, and the type of lattice. We discussed the fact that the clustering effectively begins at pmax. The percolation threshold, pc, and pmax are found to get closer to each other as the coordination number increases. PACS Nos.: 64.60.Ht, 64.60.Qb, 82.30.Nr