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.
6 pages with 4 figures, to appear in Chaos
References in corpus (9)
- Recent advances in percolation theory and its applications
- Square lattice site percolation at increasing ranges of neighbor interactions
- Gas relative permeability in unconventional reservoir rocks
- Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors
- Precise bond percolation thresholds on several four-dimensional lattices
- Restoring site percolation on a damaged square lattice
- Square lattice site percolation thresholds for complex neighbourhoods
- Site-bond percolation solution to preventing the propagation of \textit{Phytophthora} zoospores on plantations
- Method for estimating critical exponents in percolation processes with low sampling
Cited by in corpus (13)
- Percolation and the pandemic
- Site percolation on square and simple cubic lattices with extended neighborhoods and their continuum limit
- Universal behavior of site and bond percolation thresholds on regular lattices with compact extended-range neighborhoods in 2 and 3 dimensions
- Critical polynomials in the nonplanar and continuum percolation models
- Percolation thresholds on triangular lattice for neighbourhoods containing sites up-to the fifth coordination zone
- Extended-range percolation in complex networks
- Site and bond percolation on four-dimensional simple hypercubic lattices with extended neighborhoods
- Random site percolation on honeycomb lattices with complex neighborhoods
- General theory for extended-range percolation on simple and multiplex networks
- Random site percolation thresholds on square lattice for complex neighborhoods containing sites up to the sixth coordination zone
- Universality of random-site percolation thresholds for two-dimensional complex non-compact neighborhoods
- A dataflow programming framework for linear optical distributed quantum computing
- Extended-range percolation in five dimensions