The probability that planar loop-erased random walk uses a given edge

From MaRDI portal
Publication:457809

DOI10.1214/ECP.V19-2908zbMATH Open1303.82027arXiv1301.5331MaRDI QIDQ457809FDOQ457809


Authors: Gregory F. Lawler Edit this on Wikidata


Publication date: 29 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1301.5331




Recommendations





Cited In (14)





This page was built for publication: The probability that planar loop-erased random walk uses a given edge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457809)