Abstract
The two-dimensional Potts models were simulated with the use of a Monte Carlo method. This study is unique in that we simulated the weighted percolation clusters first described by Kasteleyn and Fortuin in 1969. We describe an auxiliary data structure which enables us to determine the connectedness of large clusters very efficiently. Our simulation of the percolation problem was found not to be affected by a critical slowing down. Critical exponents were found by studying the size and shape of large clusters. Our results agree with previous studies done on integer values of q, and with the conjecture of den Nijs.

This publication has 20 references indexed in Scilit: