Pseudo-random-number generators and the square site percolation threshold

Abstract

A select collection of pseudorandom number generators is applied to a Monte Carlo study of the two dimensional square site percolation model. A generator suitable for high precision calculations is identified from an application specific test of randomness. After extended computation and analysis, an ostensibly reliable value of pc = 0.59274598(4) is obtained for the percolation threshold.

Transition from antiferromagnetism to superconductivity in the compensated metallic state ofBa1−xKx(FeSuzuki1, Ohgushi2, Kiuchi3 et al. 2010Phys. Rev. B92171View full textAdd to dashboardCite

“…33 This value is much smaller than the percolation threshold of impurities on the nearest-neighbor square lattice model 0.41. 19,34 The pair breaking effect induced by the disorder is also relevant to the T c decrease. Indeed, as can be seen from Fig.…”

Assessment of Percolation Threshold Simulation for Individual and Hybrid Nanocomposites of Carbon Nanotubes and Carbon Black

“…Other studies have also shown that the percolation threshold is dependent of conductive fillers morphology (size, shape and the aspect ratio) [24][25][26][27] . The distribution of scattered points is not a real situation of electrically conductive composites; however, this method of particles distribution has been widely adopted for comparison with known percolation threshold values [28][29][30][31] .…”

Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton

“…By increasing the probability of black cells, infinite clusters more often appear, as predicted also by the percolation theory. Also, the results of the algorithm are in accordance with site percolation thresholds in the square lattice ( [16,24]). …”