Equivalence between the FLR time dependent percolation model and the Newman-Ziff algorithm

We compare the results of a very efficient algorithm that we have proposed to study the time evolution of percolation clusters when the occupation pro bability swept through the critical value in the same sample and in a singl e run with another algorithm proposed by Newman and Ziff to allow fast calc ulations of the standard percolation model. Both have a complexity per site that is roughly independent of the size of the system. Our results show th at for the derivative threshold distribution, the results (exponent = 1.8 /- 0.2) are closer to Wester while for the cumulative distribution (exponen t = 1.5 +/- 0.1), they are closer to Newman and Ziff.