Functional iterations and periodic oscillations for simple random walk on the Sierpiński graph (Q1275938)

This note is devoted to a rigorous study of the asymptotic behaviour of the \(n\)-step transition probabilities for the simple random walk on the Sierpiński graph. Methods from asymptotic combinatorics and functional iterations are used to prove two fundamental theorems on the transition probabilities. The theoretical conclusions are in a good agreement with the results of numerical experiments using Maple. The methods can be immediately applied to any higher dimensional version of the Sierpiński gasket.