The GHP scaling limit of uniform spanning trees in high dimensions
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 d-dimensional torus Znd with d>4, the hypercube \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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.