Abstract
We give a new proof of a result of Rick Kenyon that the probability that an edge in the middle of an n x n square is used in a loop-erased walk connecting opposites sides is of order n^{-3/4}. We, in fact, improve the result by showing that this estimate is correct up to multiplicative constants.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.