Large-cell Monte Carlo renormalization group for percolation

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 p₂ (b) and for the scaling powers y₏ (b) and y₇ (b). Extrapolating these sequences to the limit b 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 p₂ and y₏. Combining both the large-cell approach and the finite-size scaling results, we obtain y₏=0. 73850. 0080 and y₇=1. 8980. 003. Thus we find ₏=-0. 7080. 030, ₏=0. 138 (+0. 006, -0. 005), ₏=2. 4320. 035, ₏=18. 60. 6, ₏=1. 3540. 015, and 2-₏=1. 7960. 006. The site-percolation threshold is found for the square lattice at p₂=0. 59310. 0006. We note that our calculated value of ₏ is in considerably better agreement with the proposal of Klein et al. that ₏=ln3ln (3{2) }1. 3548, than with den Nijs' recent conjecture, which predicts ₏=43. However, our results cannot entirely rule out the latter possibility.