The GHP scaling limit of uniform spanning trees of dense graphs
Probability
2023-01-03 v1
Abstract
We consider dense graph sequences that converge to a connected graphon and prove that the GHP scaling limit of their uniform spanning trees is Aldous' Brownian CRT. Furthermore, we are able to extract the precise scaling constant from the limiting graphon. As an example, we can apply this to the scaling limit of the uniform spanning trees of the Erd\"os-R\'enyi sequence for any fixed , and sequences of dense expanders. A consequence of GHP convergence is that several associated quantities of the spanning trees also converge, such as the height, diameter and law of a simple random walk.
Cite
@article{arxiv.2301.00461,
title = {The GHP scaling limit of uniform spanning trees of dense graphs},
author = {Eleanor Archer and Matan Shalev},
journal= {arXiv preprint arXiv:2301.00461},
year = {2023}
}
Comments
31 pages