Loop-Erased Walks Intersect Infinitely Often in Four Dimensions

Gregory F. Lawler, Duke University

Abstract
In this short note we show that the paths two independent
loop-erased random walks in four
dimensions intersect infinitely often. We actually prove the stronger
result that the cut-points of the two walks intersect infinitely
often.

A. Guttman and R. Bursill,
Critical exponent for the loop-erased self-avoiding walk by
Monte Carlo methods,
J. Stat. Phys. 59 (1990), 1--9
Math Review article not available.

G. Lawler,
Intersections of Random Walks,
Birkhauser-Boston (1991).
Math Review link

G. Lawler,
Escape probabilities for slowly recurrent sets,
Probab. Theory Relat. Fields 94, 91--117 (1992).
Math Review link

G. Lawler,
Cut points for simple random walk,
Electronic J. of Prob. 1, #13 (1996).
Math Review link

G. Lawler,
Strict concavity of the intersection exponent for
Brownian motion in two and three dimensions,
preprint (1997).
Math Review article not available.

R. Lyons, Y. Peres, and O. Schramm, Can a Markov
chain intersect an independent copy only in its loops,
to appear.
Math Review article not available.

F. Spitzer,
Principles of Random Walk,
Springer-Verlag (1996).