PERCOLATION ON GROWING LATTICES
From MaRDI portal
Publication:3430366
DOI10.1142/S012918310600962XzbMATH Open1121.82326arXivcond-mat/0604418OpenAlexW1996869868WikidataQ56003994 ScholiaQ56003994MaRDI QIDQ3430366FDOQ3430366
Authors: Daniel Tiggemann
Publication date: 21 March 2007
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/cond-mat/0604418
Recommendations
Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Percolation (82B43)
Cites Work
Cited In (6)
- Lattice embeddings in percolation
- Classical percolation
- Computational study of the percolation phenomena in inhomogeneous two- and three-dimensional systems
- Interacting growth processes and invariant percolation
- Percolation in a Voronoi competition-growth model
- Growth and percolation on the uniform infinite planar triangulation
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)