We consider the two-dimensional simple random walk conditioned on never hitting the origin. This process is a Markov chain, namely it is the Doob -transform of the simple random walk with respect to the potential kernel. It is known to be transient and we show that it is “almost recurrent” in the sense that each infinite set is visited infinitely often, almost surely. We prove that, for a “large” set, the proportion of its sites visited by the conditioned walk is approximately a Uniform random variable. Also, given a set that does not “surround” the origin, we prove that a.s. there is an infinite number of ’s such that is unvisited. These results suggest that the range of the conditioned walk has “fractal” behavior.
[DRS14] An introduction to random interlacements, SpringerBriefs in Mathematics, Springer, 2014 | Zbl 1304.60008
[MPW17] Non-homogeneous random walks: Lyapunov function methods for near-critical stochastic systems, Cambridge Tracts in Mathematics, 209, Cambridge University Press, 2017 | Zbl 1376.60005
[Rev84] Markov chains, North-Holland Mathematical Library, 11, North-Holland, 1984 | Zbl 0539.60073
[Woe09] Denumerable Markov chains. Generating functions, boundary theory, random walks on trees, EMS Textbooks in Mathematics, European Mathematical Society, 2009 | Zbl 1219.60001