### Metadata

### Abstract

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 $h$-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$[0,1]$ random variable. Also, given a set $G\subset {\mathbb{R}}^{2}$ that does not “surround” the origin, we prove that a.s. there is an infinite number of $k$’s such that $kG\cap {\mathbb{Z}}^{2}$ is unvisited. These results suggest that the range of the conditioned walk has “fractal” behavior.

### References

[CP17] The vacant set of two-dimensional critical random interlacement is infinite, Ann. Probab., Volume 45 (2017) no. 6B, pp. 4752-4785 | DOI | MR | Zbl

[CPV16] Two-dimensional random interlacements and late points for random walks, Commun. Math. Phys., Volume 343 (2016) no. 1, pp. 129-164 | DOI | MR | Zbl

[DRS14] An introduction to random interlacements, SpringerBriefs in Mathematics, Springer, 2014 | Zbl

[KS64] A note on the Borel-Cantelli lemma, Ill. J. Math., Volume 8 (1964), pp. 248-251 | DOI | MR | Zbl

[LL10] Random walk: a modern introduction, Cambridge Studies in Advanced Mathematics, 123, Cambridge University Press, 2010 | MR | Zbl

[MPW17] Non-homogeneous random walks: Lyapunov function methods for near-critical stochastic systems, Cambridge Tracts in Mathematics, 209, Cambridge University Press, 2017 | Zbl

[PT15] Soft local times and decoupling of random interlacements, J. Eur. Math. Soc., Volume 17 (2015) no. 10, pp. 2545-2593 | DOI | MR | Zbl

[Rev84] Markov chains, North-Holland Mathematical Library, 11, North-Holland, 1984 | Zbl

[Szn10] Vacant set of random interlacements and percolation, Ann. Math., Volume 171 (2010) no. 3, pp. 2039-2087 | DOI | MR | Zbl

[Woe09] Denumerable Markov chains. Generating functions, boundary theory, random walks on trees, EMS Textbooks in Mathematics, European Mathematical Society, 2009 | Zbl

[ČT12] From random walk trajectories to random interlacements, Ensaios Matemáticos, 23, Sociedade Brasileira de Matemática, 2012 | MR | Zbl