Quantitative recurrence results for random walks
Abstract
First, we prove a local almost sure central limit theorem for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in 5. This gives us a quantitative version of P\'olya's Recurrence Theorem 6. Second, we prove a local almost sure central limit theorem for (not necessarly lattice) random walks in the line or in the plane, which will also give us quantitative recurrence results. Finally, we prove an almost sure central limit theorem for multidimensional (not necessarly lattice) random walks. This is achieved by exploiting a technique developed by the author in 5.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.