A simple proof of a recurrence theorem for random walks in 2
Abstract
In this note, we prove without using Fourier analysis that the symmetric square integrable random walks in 2 are recurrent.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.