Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
From MaRDI portal
Publication:6474604
arXivmath/0410430MaRDI QIDQ6474604FDOQ6474604
Authors: Yuval Peres, David Revelle 
Publication date: 19 October 2004
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.
Trees (05C05) Geometric probability and stochastic geometry (60D05) Probability theory on algebraic and topological structures (60B99)
This page was built for publication: Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6474604)
