English

The GHP scaling limit of uniform spanning trees in high dimensions

Probability 2022-04-14 v2 Combinatorics

Abstract

We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the dd-dimensional torus Znd\mathbb{Z}_n^d with d>4d>4, the hypercube {0,1}n\{0,1\}^n, and transitive expander graphs. Several corollaries for associated quantities are then deduced: convergence in distribution of the rescaled diameter, height and simple random walk on these uniform spanning trees to their continuum analogues on the continuum random tree.

Keywords

Cite

@article{arxiv.2112.01203,
  title  = {The GHP scaling limit of uniform spanning trees in high dimensions},
  author = {Eleanor Archer and Asaf Nachmias and Matan Shalev},
  journal= {arXiv preprint arXiv:2112.01203},
  year   = {2022}
}

Comments

32 pages. The proof of Lemma 2.9 in the first version of this paper is incorrect and we were unable to correct it. In this second version we provide an alternative route for the proof of the main theorems