Summary
A setA⊂Z d (d>-3) is defined to be slowly recurrent for simple random walk if it is recurrent but the probability of enteringA∩{z:n<|z|<-2n} tends to zero asn→∞. A method is given to estimate escape probabilities for such sets, i.e., the probability of leaving the ball of radiusn without entering the set. The methods are applied to two examples. First, half-lines and finite unions of half-lines inZ 3 are considered. The second example is a random walk path in four dimensions. In the latter case it is proved that the probability that two random walk paths reach the ball of radiusn without intersecting is asymptotic toc(lnn)−1/2, improving a result of the author.
Article PDF
Similar content being viewed by others
References
Duplantier, B.: Intersections of random walks: a direct renormalization approach. Commun. Math. Phys.117, 279–330 (1987)
Kesten, H.: Some caricatures of multiple contact diffusion-limited aggregation and the η-model. In: Stochastic analysis. Barlow, M., Bingham, N. (eds.), pp. 179–227. Cambridge: Cambridge University Press 1991
Lawler, G.: Intersections of random walks: Boston: Birkhäuser 1991
Lawler, G.: L-shapes for the logarithmic η-model for DLA in three dimensions. Seminar on stochastic processes. Boston: Birkhäuser 1991
Spitzer, F.: Principles of random walk: Berlin Heidelberg New York: Springer 1976
Author information
Authors and Affiliations
Additional information
Research partially supported by the National Science Foundation
Rights and permissions
About this article
Cite this article
Lawler, G.F. Escape probabilities for slowly recurrent sets. Probab. Th. Rel. Fields 94, 91–117 (1992). https://doi.org/10.1007/BF01222512
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01222512