Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs
| dc.creator | Peres, Yuval | |
| dc.creator | Revelle, David | |
| dc.date | 2004-10-19 | |
| dc.date | 2005-06-06 | |
| dc.date.accessioned | 2026-07-07T05:13:25Z | |
| dc.date.available | 2026-07-07T05:13:25Z | |
| dc.description | 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. | |
| dc.description | 6/6/05 version is substantially reorganized, with the main proof being more clearly presented as a proof by induction and the individual lemmas are now more self-contained | |
| dc.identifier | https://arxiv.org/abs/math/0410430 | |
| dc.identifier | http://arxiv.org/abs/math/0410430 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/72936 | |
| dc.subject | Probability | |
| dc.subject | 60D05 (Primary) 05C05, 60B99 (Secondary) | |
| dc.title | Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs | |
| dc.type | text |