paper

Site percolation thresholds on triangular lattice with complex neighborhoods

arXiv:2006.15621 · doi:10.1063/5.0022336

Abstract

We determine thresholds for random site percolation on a triangular lattice for neighbourhoods containing nearest (NN), next-nearest (2NN), next-next-nearest (3NN), next-next-next-nearest (4NN) and next-next-next-next-nearest (5NN) neighbours, and their combinations forming regular hexagons (3NN+2NN+NN, 5NN+4NN+NN, 5NN+4NN+3NN+2NN, 5NN+4NN+3NN+2NN+NN). We use a fast Monte Carlo algorithm, by Newman and Ziff [M. E. J. Newman and R. M. Ziff, Physical Review E 64, 016706 (2001)], for obtaining the dependence of the largest cluster size on occupation probability. The method is combined with a method, by Bastas et al. [N. Bastas, K. Kosmidis, P. Giazitzidis, and M. Maragakis, Physical Review E 90, 062101 (2014)], of estimating thresholds from low statistics data. The estimated values of percolation thresholds are , , , , , , . The method is tested on the standard case of site percolation on triangular lattice, where is recovered with five digits accuracy by averaging over one thousand lattice realisations only.

arXiv comment6 pages with 4 figures, to appear in Chaos

References in corpus (17)

Cited by in corpus (13)