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.
A site-percolation model with two different sizes of particles is newly introduced on a square lattice. To estimate the fractal dimension and critical exponents with high accuracy, a finite-size scaling analysis is performed with a Monte Carlo simulation. The obtained fractal dimension coincides with that of the ordinary model, while the estimated exponents β, γ, and ν are slightly different from those of the ordinary model. However, the normalized exponents
β^=β/ν and
γ^=γ/ν remain the same as in the ordinary model, which is a manifestation of weak universality.
We examine the average cluster distribution as a function of lattice probability for a very small
(L=6) lattice and determine the scaling function of three-dimensional percolation. The behavior of the second moment, calculated from the average cluster distribution of
L=6 and
L=63 lattices, is compared to power-law behavior predicted by the scaling function. We also examine the finite-size scaling of the critical point and the size of the largest cluster at the critical point. This analysis leads to estimates of the critical exponent $\ensuremath{\nu}$ and the ratio of critical exponents $\ensuremath{\beta}/\ensuremath{\nu}$.
Using finite-size scaling methods we measure the thermal and magnetic exponents of the site percolation in four dimensions, obtaining a value for the anomalous dimension very different from the results found in the literature. We also obtain the leading corrections-toscaling exponent and, with great accuracy, the critical density. Key words: Lattice. Monte Carlo. Percolation. Critical exponents. Finite size scaling. ffl-expansion. PACS: 12.40.Ee;64.60.A;75.40.Mg;75.40.Cx hector@lattice.fis.ucm.es y laf@lattice.fis.ucm.es z victor@lattice.fis.ucm.es x sudupe@lattice.fis.ucm.es -- parisi@roma1.infn.it k ruiz@chimera.roma1.infn.it 1 Introduction From the point of view of its definition, the simplest statistical system is perhaps the percolation. In the case of the site percolation, we fill the sites of a given lattice with probability p. Then we construct the clusters as sets of contiguous filled sites. The critical properties of the system can be described in terms of the...