Ulug, AKarakaplan, MUlug, B2024-08-042024-08-0420040008-4204https://doi.org/10.1139/P04-012https://hdl.handle.net/11616/94246Clustering 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, p(max), 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 p(max). The percolation threshold, p(c) and P-max are found to get closer to each other as the coordination number increases.eninfo:eu-repo/semantics/closedAccessCritical-ProbabilitiesSquare LatticesPercolationCompositeDiversityArticle82432332910.1139/P04-0122-s2.0-3142609472Q3WOS:000221934400006Q3