Transfer current and pattern fields in spanning trees
arXiv:1312.2946 · doi:10.1007/s00440-014-0588-2
Abstract
When a simply connected domain () is approximated in a "good" way by embedded connected weighted graphs, we prove that the transfer current matrix (defined on the edges of the graph viewed as an electrical network) converges, up to a local weight factor, to the differential of Green's function on . This observation implies that properly rescaled correlations of the spanning tree model and correlations of minimal subconfigurations in the abelian sandpile model have a universal and conformally covariant limit. We further show that, on a periodic approximation of the domain, all pattern fields of the spanning tree model, as well as the minimal-pattern (e.g. zero-height) fields of the sandpile, converge weakly in distribution to Gaussian white noise.
References in corpus (7)
- The Laplacian and operators on critical planar graphs
- Spanning forests and the vector bundle Laplacian
- Invariance principle for the random conductance model with unbounded conductances
- Approximation of conformal mappings by circle patterns
- Minimal configurations and sandpile measures
- Logarithmic conformal invariance in the Abelian sandpile model
- Pattern densities in fluid dimer models