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

We use methods from asymptotic combinatorics and functional iterations to give a rigorous proof of the fluctuating behaviour of the n-step transition probabilities for the simple random walk on the Sierpiński graph.