Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.


Decomposing recurrent states of the abelian sandpile model

Dukes, Mark and Selig, Thomas (2016) Decomposing recurrent states of the abelian sandpile model. Electronic Notes in Discrete Mathematics, 54C. pp. 97-102. ISSN 1571-0653

Text (Dukes-Selig-ENDM2016-Decomposing-recurrent-states-of-the-abelian-sandpile-model)
Dukes_Selig_ENDM2016_Decomposing_recurrent_states_of_the_abelian_sandpile_model.pdf - Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (273kB) | Preview


The recurrent states of the Abelian sandpile model (ASM) are those states that appear infinitely often. For this reason they occupy a central position in ASM research. We present several new results for classifying recurrent states of the Abelian sandpile model on graphs that may be decomposed in a variety of ways. These results allow us to classify, for certain families of graphs, recurrent states in terms of the recurrent states of its components. We use these decompositions to give recurrence relations for the generating functions of the level statistic on the recurrent configurations. We also interpret our results with respect to the sandpile group.