Invasion Percolation: New Algorithms and Universality Classes
Employing highly efficient algorithms for simulating invasion percolation (IP), whose execution time scales as O[M log(M)] or better for a cluster of M sites, and for determining the backbone of the cluster, we obtain precise estimates for the fractal dimensions of the sample-spanning cluster, the backbone, and the minimal path in order to identify the universality classes of four different IP processes (site and bond IP, with and without trapping). In two dimensions IP is characterized by two...[Show more]
|Collections||ANU Research Publications|
|Source:||Journal of Physics A: Mathematical and General|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.