The diameter of uniform spanning trees in high dimensions
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.