2000 character limit reached
The infinite two-sided loop-erased random walk
Published 19 Feb 2018 in math.PR | (1802.06667v1)
Abstract: The loop-erased random walk (LERW) in $ \Zd, d \geq 2$, is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the "middle" of the path.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.