Logarithmic corrections to scaling in the four-dimensional uniform spanning tree

Abstract

We compute the precise logarithmic corrections to mean-field scaling for various quantities describing the uniform spanning tree of the four-dimensional hypercubic lattice ${\mathbb{Z}}^4$. We are particularly interested in the distribution of the past of the origin, that is, the finite piece of the tree that is separated from infinity by the origin. We prove that the probability that the past contains a path of length $n$ is of order $(\log n{)}^{1/3}{n}^{-1}$, that the probability that the past contains at least $n$ vertices is of order $(\log n{)}^{1/6}{n}^{-1/2}$, and that the probability that the past reaches the boundary of the box $[-n,n{]}^4$ is of order $(\log n{)}^{2/3+o(1)}{n}^{-2}$. An important part of our proof is to prove concentration estimates for the capacity of the four-dimensional loop-erased random walk which may be of independent interest. Our results imply that the Abelian sandpile model also exhibits non-trivial polylogarithmic corrections to mean-field scaling in four dimensions, although it remains open to compute the precise order of these corrections.

arXiv comment80 pages. V2: Minor revisions. Accepted version, to appear in CMP

References in corpus (14)

• The Alexander-Orbach conjecture holds in high dimensions
• Marginal triviality of the scaling limits of critical 4D Ising and ${\varphi }_4^4$ models
• Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
• Scaling limits and critical behaviour of the 4-dimensional n-component $|\phi {|}^4$ spin model
• Critical two-point function of the 4-dimensional weakly self-avoiding walk
• Infinite volume limit of the Abelian sandpile model in dimensions d >= 3
• The range of tree-indexed random walk in low dimensions
• Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
• Markov Chain Intersections and the Loop-Erased Walk
• Interlacements and the Wired Uniform Spanning Forest
• Scaling limits of the three-dimensional uniform spanning tree and associated random walk
• Wired Cycle-Breaking Dynamics for Uniform Spanning Forests
• An upper bound for the probability of visiting a distant point by critical branching random walk in ${\mathbb{Z}}^4$
• The diameter of uniform spanning trees in high dimensions

Cited by in corpus (1)

• Critical exponents for a percolation model on transient graphs