Random walks on finitely ramified Sierpinski carpets (Q5934117): Difference between revisions

Sierpinski carpets are known to be self-similar fractal objects used to model diffusive processes in porous media. The algorithms used so far to simulate random walks on Sierpinski carpets have huge memory requirements. The amount of memory required growing exponentially with the number of iterations of the construction procedure. The aim of this paper is to present an algorithm that is able to simulate efficiently both `the myopic' and `the blind ant' random walker behaviour on finitely ramified Sierpinski carpets. Instead of using a bitmap of the \(n\)-th iteration of the carpet to determine the allowed neighbour sites, neighbourhood relations are stored in small lookup tables and hierarchical coordinate notation is used to give the random walker position. The resulting algorithm has low memory requirements, shows no surface effects even for extremely long walks and is well suited for modern computer architectures. Actually, the new algorithm can save about an order of magnitude of the computation time on modern CPUs. Compared to the similar algorithms in the literature, and a parallel version of the algorithm could be 140 times faster than the classical algorithms. Moreover, the exposed algorithm on finitely ramified Sierpinski carpets is easily extendible from 2-D square carpets to 3-D non-square carpets.