Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors
arXiv:1501.01586 · doi:10.1103/PhysRevE.91.043301
Abstract
In the paper random-site percolation thresholds for simple cubic lattice with sites' neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling for percolation thresholds estimation [Bastas et al., arXiv:1411.5834] is implemented for the studies of the top-bottom wrapping probability. The obtained percolation thresholds are , , , , , , , , where 3NN, 2NN, NN stands for next-next-nearest neighbors, next-nearest neighbors, and nearest neighbors, respectively. As an SC lattice with 4NN neighbors may be mapped onto two independent interpenetrated SC lattices but with two times larger lattice constant the percolation threshold (4NN) is exactly equal to (NN). The simplified Bastas et al. method allows for reaching uncertainty of the percolation threshold value similar to those obtained with classical method but ten times faster.
5 pages, 3 figures
References in corpus (5)
- Dynamical quantum phase transitions in the axial next-nearest-neighbour Ising chain
- Square lattice site percolation at increasing ranges of neighbor interactions
- Restoring site percolation on a damaged square lattice
- Tuning the magnetic and structural phase transitions of PrFeAsO via Fe/Ru spin dilution
- Monte Carlo simulations of polymers with nearest- and next nearest-neighbor interactions on square and cubic lattices