Random site percolation thresholds on square lattice for complex neighborhoods containing sites up to the sixth coordination zone

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Malarz, Krzysztof
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908405233352704
author Malarz, Krzysztof
author_facet Malarz, Krzysztof
contents The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and insulating), is useful for a range of problems from core condensed matter to interdisciplinary application of statistical physics in epidemiology or other transportation or connectivity problems. In this paper with Newman--Ziff fast Monte Carlo algorithm and finite-size scaling theory the random site percolation thresholds $p_c$ for a square lattice with complex neighborhoods containing sites from the sixth coordination zone are computed. Complex neighborhoods are those that contain sites from various coordination zones (which are not necessarily compact). We also present the source codes of the appropriate procedures (written in C) to be replaced in original Newman--Ziff code. Similar to results previously found for the honeycomb lattice, the percolation thresholds for complex neighborhoods on a square lattice follow the power law $p_c(ζ)\proptoζ^{-γ_2}$ with $γ_2=0.5454(60)$, where $ζ=\sum_i z_i r_i$ is the weighted distance of sites in complex neighborhoods ($r_i$ and $z_i$ are the distance from the central site and the number of sites in the coordination zone $i$, respectively).
format Preprint
id arxiv_https___arxiv_org_abs_2303_10423
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Random site percolation thresholds on square lattice for complex neighborhoods containing sites up to the sixth coordination zone
Malarz, Krzysztof
Statistical Mechanics
The site percolation problem is one of the core topics in statistical physics. Evaluation of the percolation threshold, which separates two phases (sometimes described as conducting and insulating), is useful for a range of problems from core condensed matter to interdisciplinary application of statistical physics in epidemiology or other transportation or connectivity problems. In this paper with Newman--Ziff fast Monte Carlo algorithm and finite-size scaling theory the random site percolation thresholds $p_c$ for a square lattice with complex neighborhoods containing sites from the sixth coordination zone are computed. Complex neighborhoods are those that contain sites from various coordination zones (which are not necessarily compact). We also present the source codes of the appropriate procedures (written in C) to be replaced in original Newman--Ziff code. Similar to results previously found for the honeycomb lattice, the percolation thresholds for complex neighborhoods on a square lattice follow the power law $p_c(ζ)\proptoζ^{-γ_2}$ with $γ_2=0.5454(60)$, where $ζ=\sum_i z_i r_i$ is the weighted distance of sites in complex neighborhoods ($r_i$ and $z_i$ are the distance from the central site and the number of sites in the coordination zone $i$, respectively).
title Random site percolation thresholds on square lattice for complex neighborhoods containing sites up to the sixth coordination zone
topic Statistical Mechanics
url https://arxiv.org/abs/2303.10423