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

DOI10.1007/S00440-008-0149-7MaRDI QIDQ2391165zbMATH OpenOpenAlexFDO

Authors Jason Schweinsberg

Publication date 24 July 2009

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

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

zbMATH Keywords

continuum random treeloop-erased random walkuniform spanning tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: Let x and y be points chosen uniformly at random from $$, 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^2(logn{)}^{1/6}$, resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on $$ 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 $dgeq5$, in combination with results of Lawler concerning intersections of four-dimensional random walks.

Review text

This paper is primarily concerned with the scaling limit of the uniform spanning tree on the four-dimensional discrete torus \(\mathbb{Z}_n^4\). The main result is that when scaled by \(\gamma_n n^2 (\log n)^{1/6}\) (where \(\gamma_n\) is a sequence bounded away from \(0\) and infinity), the uniform spanning tree converges in distribution to the continuum random tree. The continuum random tree is also the scaling limit of the uniform spanning tree on the complete graph. A uniform spanning tree on a graph can be generated by using Wilson's algorithm using loop-erased random walks. The main result of the paper is arrived at by coupling Wilson's algorithm on the complete graph and on the discrete torus. A similar approach was used in [\textit{Y. Peres} and \textit{D. Revelle}, Electron. J. Probab. 9, Paper No.~26, 825--845, electronic only (2004; Zbl 1064.60095), \url{arXiv:math/0410430}] to obtain the scaling limit of the uniform spanning tree on the discrete torus in dimensions \(d\geq 5\). As a consequence of the main result and the relationship between uniform spanning trees and loop erased random walks, the typical length of a loop erased random walk on \(\mathbb{Z}_n^4\) is of the order \(n^2 (\log n)^{1/6}\).

Recommendations

• Choosing a spanning tree for the integer lattice uniformly
• Uniform spanning trees on Sierpiński graphs
• scientific article; zbMATH DE number 1984558
• Logarithmic corrections to scaling in the four-dimensional uniform spanning tree
• Loop erased walks and uniform spanning trees
• Spectral dimension and random walks on the two dimensional uniform spanning tree
• scientific article; zbMATH DE number 1195780
• Publication:4938900
• Loop-erased random walk on a torus in dimensions 4 and above

Cites work

• Choosing a spanning tree for the integer lattice uniformly
• Conformal invariance of planar loop-erased random walks and uniform spanning trees.
• Escape probabilities for slowly recurrent sets
• scientific article; zbMATH DE number 5819433 (Why is no real title available?)
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• scientific article; zbMATH DE number 2042290 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Intersections of random walks.
• Loop-erased random walk on a torus in dimensions 4 and above
• Loop-erased random walk on finite graphs and the Rayleigh process
• Markov chain intersections and the loop-erased walk
• The continuum random tree. I
• The continuum random tree. III
• The logarithmic correction for loop-erased walk in four dimensions
• The scaling limit of loop-erased random walk in three dimensions

Cited in

(18)

• The logarithmic correction for loop-erased walk in four dimensions
• Interlacements and the wired uniform spanning forest
• Conformal invariance of planar loop-erased random walks and uniform spanning trees.
• Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
• Loop-erased partitioning of a graph: mean-field analysis
• Four-dimensional loop-erased random walk
• Universality of high-dimensional spanning forests and sandpiles
• Loop-erased random walk on a torus in dimensions 4 and above
• The diameter of uniform spanning trees in high dimensions
• Loop-erased random walk branch of uniform spanning tree in topological polygons
• Logarithmic corrections to scaling in the four-dimensional uniform spanning tree
• Models of random subtrees of a graph
• The GHP scaling limit of uniform spanning trees in high dimensions
• Spectral dimension and random walks on the two dimensional uniform spanning tree
• Logarithmic corrections to the Alexander-Orbach conjecture for the four-dimensional uniform spanning tree
• Random graph asymptotics on high-dimensional tori
• Finite size scaling of the 5D Ising model with free boundary conditions
• Loop-erased random walk on finite graphs and the Rayleigh process

This page was built for publication: The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391165)