Reflecting random walk in fractal domains
classification
🧮 math.PR
keywords
randomreflectingapproximatedboundedbrownianconnecteddomaindomains
read the original abstract
In this paper, we show that reflecting Brownian motion in any bounded domain D can be approximated, as $k\to\infty$, by simple random walks on "maximal connected" subsets of $(2^{-k}\mathbb{Z}^d)\cap D$ whose filled-in interiors are inside of D.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.