Scaling Limit of the Prudent Walk

Abstract

We describe the scaling limit of the nearest neighbour prudent walk on the square lattice, which performs steps uniformly in directions in which it does not see sites already visited. We show that the scaling limit is given by the process Z(u) = s_1 theta^+(3u/7) e_1 + s_2 theta^-(3u/7) e_2, where e_1, e_2 is the canonical basis, theta^+(t), resp. theta^-(t), is the time spent by a one-dimensional Brownian motion above, resp. below, 0 up to time t, and s_1, s_2 are two random signs. In particular, the asymptotic speed of the walk is well-defined in the L^1-norm and equals 3/7.

Better exposition, stronger claim, simpler description of the limiting process; final version, to appear in Electr. Commun. Probab.

References in corpus (1)

• Families of prudent self-avoiding walks

Cited by in corpus (9)

• Families of prudent self-avoiding walks
• Greedy walk on the real line
• Interacting partially directed self-avoiding walk: a probabilistic perspective
• Random walk with barycentric self-interaction
• Stability of the Greedy Algorithm on the Circle
• Scaling limit of the uniform prudent walk
• Random walks avoiding their convex hull with a finite memory
• Collapse transition of the interacting prudent walk
• Superdiffusive planar random walks with polynomial space-time drifts