Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs

Details Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs

2004-10-19

arxiv.org/abs/math/0410430v2

Mathematics

Probability

6/6/05 version is substantially reorganized, with the main proof being more clearly presented as a proof by induction and the

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-513523