Tree Formulas , Mean First Passage times and Kemeny ’ S Constant of a Markov ChainJim Pitman, WENPIN TANG2016Highly Influenced5 Excerpts

Hausdorff dimension of the scaling limit of loop-erased random walk in three dimensionsDaisuke Shiraishi2018Highly Influenced4 Excerpts

Intersection Exponents for Planar Brownian MotionMotionGregory F. Lawler, Wendelin WernerOctober1998Highly Influenced17 Excerpts

Geometry of uniform spanning forest omponents in high dimensionsMartin T. Barlow, A. Járai20171 Excerpt

Subsequential scaling limits of simple random walk on the two-dimensional uniform spanning treeMartin T. Barlow, D. A. Croydon, Takashi Kumagai20141 Excerpt

The asymptotic distribution of the discrete Laplacian, preprintR. Kenyon1998Highly Influential8 Excerpts

Generating Random Spanning Trees More Quickly than the Cover TimeDavid Bruce WilsonSTOC1996Highly Influential4 Excerpts

Hitting probabilities of random walks onZd, StocH. KestenProc. and Appl1987Highly Influential3 Excerpts

Scaling limits for minimal and random spanning trees in two dimensionsMichael Aizenman, Almut Burchard, Charles M. Newman, David Bruce WilsonRandom Struct. Algorithms1999

A Lower Bound on the Growth Exponent for Loop-erased Random Walk in Two DimensionsD F Lawler19981 Excerpt

How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed GraphJames Gary Propp, David Bruce WilsonJ. Algorithms19983 Excerpts

Hölder Regularity and Dimension Bounds for Random CurvesMichael Aizenman, Almut Burchard19981 Excerpt

Large scale degrees and the number of spanning clusters for the uniform spanning tree, preprintI. Benjamini19981 Excerpt

Strict Concavity of the Intersection Exponent for Brownian Motion in Two and Three DimensionsD F Lawler19981 Excerpt