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

DOI10.1007/S00440-008-0149-7MaRDI QIDQ2391165zbMATHOpenAlexFDO

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

loop-erased random walkcontinuum random treeuniform spanning tree

Mathematics Subject Classification ID

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

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.

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

• 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?)
• 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
• 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

(17)

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

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)