Average height for Abelian sandpiles and the looping constant on Sierpiński graphs

For the Abelian sandpile model on Sierpiński graphs, we investigate several statistics such as average height, height probabilities and looping constant. In particular, we calculate the expected average height of a recurrent sandpile on the finite iterations of the Sierpiński gasket and we also give an algorithmic approach for calculating the height probabilities of recurrent sandpiles under stationarity by using the connection between recurrent configurations of the Abelian sandpile Markov chain and uniform spanning trees. We also calculate the expected fraction of vertices of height <i>i</i> for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow><mml:mi>i</mml:mi> <mml:mo>∈</mml:mo> <mml:mo>{</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo>}</mml:mo></mml:mrow> </mml:math> of sandpiles under stationarity and relate the bulk average height to the looping constant on the Sierpiński gasket.