  We prove that, on the infinite Sierpinski gasket graph SG, rotor walk with
random initial configuration of rotors is recurrent. We also give a necessary
condition for an i.i.d. sandpile to stabilize. In particular, we prove that an
i.i.d. sandpile with expected number of chips per site greater or equal to
three does not stabilize almost surely. Furthermore, the proof also applies to
divisible sandpiles and shows that divisible sandpile at critical density one
does not stabilize almost surely on SG.
