Skip navigation
Skip navigation

Invasion Percolation: New Algorithms and Universality Classes

Sheppard, Adrian; Knackstedt, Mark; Pinczewski, Wolf Val; Sahimi, Muhammad


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]

CollectionsANU Research Publications
Date published: 1999
Type: Journal article
Source: Journal of Physics A: Mathematical and General
DOI: 10.1088/0305-4470/32/49/101


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator