Random rotor walks and i.i.d. sandpiles on Sierpinski graphs

MaRDI QIDQ6508064arXivFDO

Authors Robin Kaiser, Ecaterina Sava

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81) Probabilistic potential theory (60J45)

Abstract: 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.

This page was built for publication: Random rotor walks and i.i.d. sandpiles on Sierpinski graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6508064)