Reflecting random walk in fractal domains
Abstract
In this paper, we show that reflecting Brownian motion in any bounded domain D can be approximated, as k∞, by simple random walks on "maximal connected" subsets of (2-kZd) D whose filled-in interiors are inside of D.
0
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.