The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus

2006/02/23 by Schweinsberg, Jason
#60D05 (Secondary) #60G50 (Primary) 60K35 #FOS: Mathematics #Probability (math.PR)

paper · doi:10.48550/arxiv.math/0602515

Abstract

Let x and y be points chosen uniformly at random from \Z_n⁴, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n² (log n)^1/6, resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on \Z_n⁴ is the Brownian continuum random tree of Aldous. Our proofs use the techniques developed by Peres and Revelle, who studied the scaling limits of the uniform spanning tree on a large class of finite graphs that includes the d-dimensional discrete torus for d ≥ 5, in combination with results of Lawler concerning intersections of four-dimensional random walks.

Related

• Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
• Loop-erased random walk on a torus in dimensions 4 and above
• The GHP scaling limit of uniform spanning trees in high dimensions
• Loop-Erased Random Walk Branch of Uniform Spanning Tree in Topological Polygons
• Loop-erased random walk on finite graphs and the Rayleigh process