PERCOLATION ON GROWING LATTICES

Daniel Tiggemann ()
Additional contact information
Daniel Tiggemann: Institute of Theoretical Physics, University of Cologne, 50937 Köln, European Union, Germany

International Journal of Modern Physics C (IJMPC), 2006, vol. 17, issue 08, 1141-1150

Abstract: In order to investigate the dependence on lattice size of several observables in percolation, the Hoshen–Kopelman algorithm was modified so that growing lattices could be simulated. By this way, when simulating a lattice of sizeL, lattices of smaller sizes can be simulated in the same run for free, saving computing time.Here, site percolation in three dimensions was studied. Lattices of up toL = 5000, with manyL-steps in between, have been simulated, for occupation probabilities ofp = 0.25,p = 0.3,p = pc= 0.311608, andp = 0.35.

Keywords: Percolation; Hoshen–Kopelman algorithm; growing lattices (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S012918310600962X
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:17:y:2006:i:08:n:s012918310600962x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S012918310600962X

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().