When we apply finite-size-scaling analysis to Monte-Carlo calculations of the electrical conductivity of simple-cubic, bond- and site-percolation lattices, we obtain a correlation-length critical exponent in good agreement with current values but, for the conductivity exponent, we find t = 2.06 ± 0.16, significantly higher than the value currently cited. This new value appears, however, in essential agreement with a recently proposed theoretical conjecture.
Calculating, by a Monte Carlo technique, the conductivities of small, two-dimensional, square, bond-percolation networks (4*4 to 50*50) at a limited number of probability values, from the critical region to full conductivity, the authors have been able to show, by an original interpolation technique, that in the critical region the conductivity function does indeed obey a universal, Fisher-type, finite-size scaling function. They further show that this technique permits them to deduce values of the critical exponents for both the conductivity and the correlation length, even from calculations on relatively small networks.
Using a histogram Monte Carlo simulation method (HMCSM), Hu, Lin, and Chen found that bond and site percolation models on planar lattices have universal finite-size scaling functions for the existence probability
Ep, the percolation probability
P, and the probability
Wn for the appearance of
n percolating clusters in these models. In this paper we extend above study to percolation on three-dimensional lattices with various linear dimensions
L. Using the HMCSM, we calculate the existence probability
Ep and the percolation probability
P for site and bond percolation on a simple-cubic (sc) lattice, and site percolation on body-centered-cubic and face-centered-cubic lattices; each lattice has the same linear dimension in three dimensions. Using the data of
Ep and
P in a percolation renormalization group method, we find that the critical exponents obtained are quite consistent with the universality of critical exponents. Using a small number of nonuniversal metric factors, we find that
Ep and
P have universal finite-size scaling functions. This implies that the critical
Ep is a universal quantity, which is $0.265\ifmmode\pm\else\textpm\fi{}0.005$ for free boundary conditions and $0.924\ifmmode\pm\else\textpm\fi{}0.005$ for periodic boundary conditions. We also find that
Wn for site and bond percolation on sc lattices have universal finite-size scaling functions.
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolations are studied on a number of lattices in two and three dimensions. Quite good results for the wrapping probabilities, correlation length critical exponent, and critical concentration are obtained for the square, simple cubic, hexagonal close packed, and hexagonal lattices by using relatively small systems. We also confirm the universal aspect of the wrapping probabilities regarding site and bond dilution.
A Monte Carlo renormalisation group approach using a scaling transformation in real space is applied to the critical properties for the site percolation problem on the simple cubic lattice. The authors find a sequence of estimates for the critical concentration p c and the eigenvalue lambda at various values of the rescaling length b. Extrapolation of these sequences to the limit b to infinity yields the site percolation threshold p c =0.3115+0.0004/-0.0003 and the connectedness length exponent nu =0.88+or-0.04.
We study the site-bond-correlated percolation model in two and three dimensions. In this model, two first-neighbor sites are considered to be joined by an active bond if both are present and if their first neighbors, along the line joining them, are also present. Using a Monte Carlo renormalization-group approach, we calculate percolation thresholds and critical exponents for both square and simple cubic lattices. Our results indicate that the correlated model is in the same universality class as usual percolation, in two and three dimensions; the critical probabilities for the square and simple cubic lattices are found to be 0.7402\ifmmode\pm\else\textpm\fi{}0.0002 and 0.5660\ifmmode\pm\else\textpm\fi{}0.0004, respectively.
We obtain the critical parameters for the site-percolation problem on the square lattice to a high degree of accuracy (comparable to that of series expansions) by using a Monte Carlo position-space renormalization-group procedure directly on the site-occupation probability. Our method involves calculating recursion relations using progressively larger lattice rescalings,
b. We find smooth sequences for the value of the critical percolation concentration
pc(b) and for the scaling powers
yp(b) and
yh(b). Extrapolating these sequences to the limit $b\ensuremath{\rightarrow}\ensuremath{\infty}$ leads to quite accurate numerical predictions. Further, by considering other weight functions or "rules" which also embody the essential connectivity feature of percolation, we find that the numerical results in the infinite-cell limit are in fact "rule independent." However, the actual fashion in which this limit is approached does depend upon the rule chosen. A connection between extrapolation of our renormalization-group results and finite-size scaling is made. Furthermore, the usual finite-size scaling arguments lead to independent estimates of
pc and
yp. Combining both the large-cell approach and the finite-size scaling results, we obtain ${y}_{p}=0.7385\ifmmode\pm\else\textpm\fi{}0.0080$ and ${y}_{h}=1.898\ifmmode\pm\else\textpm\fi{}0.003$. Thus we find ${\ensuremath{\alpha}}_{p}=\ensuremath{-}0.708\ifmmode\pm\else\textpm\fi{}0.030$, ${\ensuremath{\beta}}_{p}=0.138(+0.006,\ensuremath{-}0.005)$, ${\ensuremath{\gamma}}_{p}=2.432\ifmmode\pm\else\textpm\fi{}0.035$, ${\ensuremath{\delta}}_{p}=18.6\ifmmode\pm\else\textpm\fi{}0.6$, ${\ensuremath{\nu}}_{p}=1.354\ifmmode\pm\else\textpm\fi{}0.015$, and $2\ensuremath{-}{\ensuremath{\eta}}_{p}=1.796\ifmmode\pm\else\textpm\fi{}0.006$. The site-percolation threshold is found for the square lattice at ${p}_{c}=0.5931\ifmmode\pm\else\textpm\fi{}0.0006$. We note that our calculated value of ${\ensuremath{\nu}}_{p}$ is in considerably better agreement with the proposal of Klein et al. that ${\ensuremath{\nu}}_{p}=\frac{\mathrm{ln}\sqrt{3}}{\mathrm{ln}(\frac{3}{2})}\ensuremath{\cong}1.3548$, than with den Nijs' recent conjecture, which predicts ${\ensuremath{\nu}}_{p}=\frac{4}{3}$. However, our results cannot entirely rule out the latter possibility.