arXiv:0902.4312 [math.PR]AbstractReferencesReviewsResources
Scaling Limit of the Prudent Walk
V. Beffara, S. Friedli, Y. Velenik
Published 2009-02-25, updated 2010-02-11Version 4
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.
Comments: Better exposition, stronger claim, simpler description of the limiting process; final version, to appear in Electr. Commun. Probab.
Journal: Electron. Commun. Probab., Vol. 15 (2010) , p. 44--58
Keywords: scaling limit, nearest neighbour prudent walk, one-dimensional brownian motion, performs steps, time spent
Tags: journal article
Related articles: Most relevant | Search more
Scaling Limits for Internal Aggregation Models with Multiple Sources
Simple Random Walk on Long Range Percolation Clusters II: Scaling Limits
arXiv:1001.2459 [math.PR] (Published 2010-01-14)
Scaling limit of the random walk among random traps on Z^d