Abstract
We show that the diameter of a uniformly drawn spanning tree of a connected graph on n vertices which satisfies certain high-dimensionality conditions typically grows like Θ(n). In particular this result applies to expanders, finite tori Zmd of dimension d≥ 5 , the hypercube { 0 , 1 } m, and small perturbations thereof.
Cite
CITATION STYLE
APA
Michaeli, P., Nachmias, A., & Shalev, M. (2021). The diameter of uniform spanning trees in high dimensions. Probability Theory and Related Fields, 179(1–2), 261–294. https://doi.org/10.1007/s00440-020-00999-2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free