The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus (Q2391165)

This paper is primarily concerned with the scaling limit of the uniform spanning tree on the four-dimensional discrete torus \(\mathbb{Z}_n^4\). The main result is that when scaled by \(\gamma_n n^2 (\log n)^{1/6}\) (where \(\gamma_n\) is a sequence bounded away from \(0\) and infinity), the uniform spanning tree converges in distribution to the continuum random tree. The continuum random tree is also the scaling limit of the uniform spanning tree on the complete graph. A uniform spanning tree on a graph can be generated by using Wilson's algorithm using loop-erased random walks. The main result of the paper is arrived at by coupling Wilson's algorithm on the complete graph and on the discrete torus. A similar approach was used in [\textit{Y. Peres} and \textit{D. Revelle}, Electron. J. Probab. 9, Paper No.~26, 825--845, electronic only (2004; Zbl 1064.60095), \url{arXiv:math/0410430}] to obtain the scaling limit of the uniform spanning tree on the discrete torus in dimensions \(d\geq 5\). As a consequence of the main result and the relationship between uniform spanning trees and loop erased random walks, the typical length of a loop erased random walk on \(\mathbb{Z}_n^4\) is of the order \(n^2 (\log n)^{1/6}\).