Expected First Return Times for Random Walks on Bounded Grids
Abstract
We derive a general formula for computing the expected first return time of a random walk on a finite graph. Using this framework, we calculate the expected first return time in various settings over bounded rectangular grids with different boundary conditions.
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.