Abelian sandpile recurrent states ↔ spanning trees via burning algorithm
Grains: 0 Avalanche size: 0
The abelian sandpile model: add grains randomly; sites with ≥4 grains topple (distribute to neighbors); boundary grains are lost. Dhar's burning algorithm tests if a configuration is recurrent (an element of the sandpile group) by computing the bijection with spanning trees of the underlying graph. Click to add grains manually.