Fluctuations of loop-erased random walk length and uniform spanning tree graph distance

Determine the scaling limit of the fluctuations of the length of loop-erased random walk up to time n and of graph distance in the uniform spanning tree, including the limiting process under the fluctuation scaling considered for graph distance and effective resistance of the random-walk trace.

Background

The paper identifies stable-law fluctuation limits for graph distance and effective resistance on the trace of a random walk in dimensions four and five. It suggests that the coupling between long-range intersections of the random-walk trace and long-range percolation could also address loop-erased random walk and uniform spanning tree observables.

The authors emphasize that loop-erased random walk depends strongly on long-range edges, while also requiring the temporal ordering of long-range intersections to be incorporated. The unresolved issue is to identify the appropriate fluctuation scaling limit and its limiting process for the loop-erased-walk length and the uniform-spanning-tree graph distance.

References

What is the scaling limit of the fluctuations of the length of the loop-erased random walk up to time $n$ or the graph distance in the uniform spanning tree? More precisely, if one considers the same type of fluctuation as in this paper, to what limiting process does it converge?

— Graph distance and effective resistance of the random walk trace in four and five dimensions  (2608.23135 - Adhikari et al., 24 Aug 2026) in Section 1, subsection “Open Problems”