Square lattice site percolation at increasing ranges of neighbor interactions
K. Malarz, S. Galam
Abstract
We report site percolation thresholds for square lattice with neighbor interactions at various increasing ranges. Using Monte Carlo techniques we found that nearest neighbors (N2), next nearest neighbors (N3), next next nearest neighbors (N4) and fifth nearest neighbors (N6) yield the same pc=0.592.... At odds, fourth nearest neighbors (N5) give pc=0.298.... These results are given an explanation in terms of symmetry arguments. We then consider combinations of various ranges of interactions with (N2+N3), (N2+N4), (N2+N3+N4) and (N2+N5). The calculated associated thresholds are respectively pc=0.407..., 0.337..., 0.288..., 0.234.... The existing Galam--Mauger universal formula for percolation thresholds does not reproduce the data showing dimension and coordination number are not sufficient to build a universal law which extends to complex lattices.
Create a lesson
Related papers
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits