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

Asiye Ulug, Mustafa Karakaplan, Bülent Ulug

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)323-329
Number of pages7
JournalCanadian Journal of Physics
Volume82
Issue number4
DOIs
Publication statusPublished - Apr 2004
Externally publishedYes

Fingerprint

Dive into the research topics of 'Clustering in some randomly occupied two- and three-dimensional lattices'. Together they form a unique fingerprint.

Cite this