The diameter of uniform spanning trees in high dimensions

DOI10.1007/s00440-020-00999-2zbMath1460.05057arXiv1911.12319OpenAlexW3091957038MaRDI QIDQ2660390

Matan Shalev, Peleg Michaeli, Asaf Nachmias

Publication date: 30 March 2021

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.12319

zbMATH Keywords

loop-erased random walkcontinuum random tree

Mathematics Subject Classification ID

Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Distance in graphs (05C12) Random walks on graphs (05C81)

Related Items (4)

The diameter of the uniform spanning tree of dense graphs ⋮ The local limit of uniform spanning trees ⋮ Logarithmic corrections to scaling in the four-dimensional uniform spanning tree ⋮ The GHP scaling limit of uniform spanning trees in high dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The continuum random tree. I
• Vacant set of random interlacements and percolation
• The Alexander-Orbach conjecture holds in high dimensions
• A self-avoiding random walk
• Choosing a spanning tree for the integer lattice uniformly
• Moderate growth and random walk on finite groups
• Interlacements and the wired uniform spanning forest
• Uniform spanning forests
• Universality of high-dimensional spanning forests and sandpiles
• The continuum random tree. III
• The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
• Probability on Trees and Networks
• Diameter of random spanning trees in a given graph
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: The diameter of uniform spanning trees in high dimensions