Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
read the original abstract
Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the discrete torus in dimensions 5 and above. Moreover, on this family of graphs we show that a suitably normalized finite-dimensional scaling limit of the uniform spanning tree is a Brownian continuum random tree.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Capacity of loop-erased random walk
Proves strong law and explicit limits for LERW capacity in d≥4, ergodicity in d=4, and random scaling limit of order n^{1/β} in d=3 expressed via Kozma's scaling limit, with corollary on capacity-parametrized LERW scaling.
-
Random spanning trees in random environment
RSTRE model on K_n with i.i.d. uniform disorders exhibits diameter n^{1/2} for β ≤ C n/log n and n^{1/3} for β ≥ n^{4/3} log n, with conjecture for intermediate exponents.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.