This is the authors' abstract. We don't add key points for this paper.
Based on an effective single cluster growth algorithm, bond percolation on square lattice with the nearest neighbors, the next nearest neighbors, up to the 5th nearest neighbors are investigated by Monte Carlo simulations. The bond percolation thresholds for more than 20 lattices are deduced, and the correlations between percolation threshold <tex-math id="M8">{document}pc{document}</tex-math><alternatives></alternatives> and lattice structures are discussed in depth. By introducing the index <tex-math id="M9">{document}ξ = ∑ᵢ zᵢ rᵢ² / i{document}</tex-math><alternatives></alternatives> to remove the degeneracy, it is found that the thresholds follow a power law <tex-math id="M10">{document}pc ∝ ξ-γ{document}</tex-math><alternatives></alternatives>, with <tex-math id="M11">{document}γ ≈ 1{document}</tex-math><alternatives></alternatives>, where <tex-math id="M12">{document}zᵢ{document}</tex-math><alternatives></alternatives> is the ith neighborhood coordination number, and <tex-math id="M13">{document}rᵢ{document}</tex-math><alternatives></alternatives> is the distance between sites in the i-th coordination zone and the central site.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Xun et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: