Maximal local time of a d-dimensional simple random walk on subsets
Abstract
Strong theorems are given for the maximal local time on balls and subspaces for the d-dimensional simple symmetric random walk.
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.