PERCOLATION ON GROWING LATTICES

DOI10.1142/S012918310600962XMaRDI QIDQ3430366zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Tiggemann

Publication date 21 March 2007

Published in International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0604418

zbMATH Keywords

percolationgrowing latticesHoshen-Kopelman algorithm

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Percolation (82B43)

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 size L, 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 to L=5000, with many L-steps in between, have been simulated, for occupation probabilities of p=0.25, p=0.3, p=p_c=0.311608, and p=0.35.

Recommendations

• Size distribution of percolating clusters on cubic lattices
• Alternative techniques for cluster labelling on percolation theory
• Exact site-percolation probability on the square lattice
• scientific article; zbMATH DE number 3988433
• Cluster size distribution at criticality

Cited in

(6)

• Percolation in a Voronoi competition-growth model
• Growth and percolation on the uniform infinite planar triangulation
• Lattice embeddings in percolation
• Classical percolation
• Interacting growth processes and invariant percolation
• Computational study of the percolation phenomena in inhomogeneous two- and three-dimensional systems

This page was built for publication: PERCOLATION ON GROWING LATTICES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430366)