Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the range of a two-dimensional conditioned simple random walk (1804.00291v2)

Published 1 Apr 2018 in math.PR

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.

Summary

We haven't generated a summary for this paper yet.