Anchored burning bijections on finite and infinite graphs
arXiv:1405.5397 · doi:10.1214/EJP.v19-3542
Abstract
Let be an infinite graph such that each tree in the wired uniform spanning forest on has one end almost surely. On such graphs , we give a family of continuous, measure preserving, almost one-to-one mappings from the wired spanning forest on to recurrent sandpiles on , that we call anchored burning bijections. In the special case of , , we show how the anchored bijection, combined with Wilson's stacks of arrows construction, as well as other known results on spanning trees, yields a power law upper bound on the rate of convergence to the sandpile measure along any exhaustion of . We discuss some open problems related to these findings.
arXiv comment26 pages; 1 EPS figure. Minor alterations made after comments from referee
References in corpus (9)
- Chip-Firing and Rotor-Routing on Directed Graphs
- Scaling Limits for Minimal and Random Spanning Trees in Two Dimensions
- Height variables in the Abelian sandpile model: scaling fields and correlations
- Infinite volume limit of the Abelian sandpile model in dimensions d >= 3
- Minimal configurations and sandpile measures
- Exponential tail bounds for loop-erased random walk in two dimensions
- Abelian Sandpiles and the Harmonic Model
- Approaching criticality via the zero dissipation limit in the abelian avalanche model
- Rate of convergence estimates for the zero dissipation limit in Abelian sandpiles