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

## TL;DR

This paper studies the Abelian sandpile model on Sierpiński graphs, calculating average heights and relating them to the looping constant.

## Contribution

The paper introduces a novel algorithmic approach to calculate height probabilities using uniform spanning trees on Sierpiński graphs.

## Key findings

- The expected average height of recurrent sandpiles on finite Sierpiński gasket iterations was calculated.
- The fraction of vertices with specific heights under stationarity was determined for i ∈ {0,1,2,3}.
- A relationship between bulk average height and the looping constant on the Sierpiński gasket was established.

## Abstract

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 for \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$i\in \{0,1,2,3\}$$\end{document}i∈{0,1,2,3} of sandpiles under stationarity and relate the bulk average height to the looping constant on the Sierpiński gasket.