Logarithmic corrections to the Alexander-Orbach conjecture for the four-dimensional uniform spanning tree
Noah Halberstam, Tom Hutchcroft

TL;DR
This paper precisely characterizes the logarithmic corrections to the Alexander-Orbach conjecture for the four-dimensional uniform spanning tree, revealing detailed asymptotic behaviors of volume, random walk displacement, and return probability.
Contribution
It provides the first rigorous derivation of logarithmic corrections to the Alexander-Orbach conjecture in four dimensions for the uniform spanning tree.
Findings
Volume of intrinsic n-ball is approximately n^2 / (log n)^{1/3}
Typical displacement of n-step random walk is about n^{1/3} (log n)^{1/9}
Return probability decays as n^{-2/3} (log n)^{1/9}
Abstract
We compute the precise logarithmic corrections to Alexander-Orbach behaviour for various quantities describing the geometric and spectral properties of the four-dimensional uniform spanning tree. In particular, we prove that the volume of an intrinsic -ball in the tree is , that the typical intrinsic displacement of an -step random walk is , and that the -step return probability of the walk decays as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Diffusion and Search Dynamics · Stochastic processes and statistical mechanics
