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.
Original language | English |
---|---|
Pages (from-to) | 261-294 |
Number of pages | 34 |
Journal | Probability Theory and Related Fields |
Volume | 179 |
Issue number | 1-2 |
DOIs | |
State | Published - Feb 2021 |
All Science Journal Classification (ASJC) codes
- Analysis
- Statistics and Probability
- Statistics, Probability and Uncertainty