Random walks on finitely ramified Sierpinski carpets

A new algorithm is presented that allows an efficient computer simulation o f random walks on finitely ramified Sierpinski carpets. instead of using a bitmap of the nth iteration of the carpet to determine allowed neighbor sit es, neighbourhood relations are stored in small lookup tables and a hierarc hical coordinate notation is used to give the random walker position. The r esulting algorithm has low memory requirements, shows no surface effects ev en for extremely long walks and is well suited for modem computer architect ures. (C) 2001 Elsevier Science B.V. All rights reserved.