The diameter of uniform spanning trees in high dimensions

Peleg Michaeli, Asaf Nachmias, Matan Shalev

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)261-294
Number of pages34
JournalProbability Theory and Related Fields
Issue number1-2
StatePublished - Feb 2021

All Science Journal Classification (ASJC) codes

  • Analysis
  • Statistics and Probability
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'The diameter of uniform spanning trees in high dimensions'. Together they form a unique fingerprint.

Cite this