@article{EJP13,
author = {Gregory Lawler},
title = {Cut Times for Simple Random Walk},
journal = {Electron. J. Probab.},
fjournal = {Electronic Journal of Probability},
volume = {1},
year = {1996},
keywords = {Random walk, cut points, intersection exponent},
abstract = {Let $S(n)$ be a simple random walk taking values in $Z^d$. A time $n$ is called a cut time if
\[ S[0,n] \cap S[n+1,\infty) = \emptyset . \]
We show that in three dimensions the number of cut times less than $n$ grows like $n^{1 - \zeta}$ where $\zeta = \zeta_d$ is the intersection exponent. As part of the proof we show that in two or three dimensions
\[ P(S[0,n] \cap S[n+1,2n] = \emptyset ) \sim n^{-\zeta}, \]
where $\sim$ denotes that each side is bounded by a constant times the other side.},
pages = {no. 13, 1-24},
issn = {1083-6489},
doi = {10.1214/EJP.v1-13},
url = {http://ejp.ejpecp.org/article/view/13}}