Discrete approximations to reflected Brownian motion

From MaRDI portal
Publication:2482284

DOI10.1214/009117907000000240zbMATH Open1141.60014arXivmath/0611114OpenAlexW3105314077MaRDI QIDQ2482284FDOQ2482284


Authors: K. Burdzy, Zhen-Qing Chen Edit this on Wikidata


Publication date: 16 April 2008

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: In this paper we investigate three discrete or semi-discrete approximation schemes for reflected Brownian motion on bounded Euclidean domains. For a class of bounded domains D in mathbbRn that includes all bounded Lipschitz domains and the von Koch snowflake domain, we show that the laws of both discrete and continuous time simple random walks on Dcap2kmathbbZn moving at the rate 22k with stationary initial distribution converge weakly in the space mathbfD([0,1],mathbbRn), equipped with the Skorokhod topology, to the law of the stationary reflected Brownian motion on D. We further show that the following ``myopic conditioning algorithm generates, in the limit, a reflected Brownian motion on any bounded domain D. For every integer kgeq1, let Xj2kk,j=0,1,2,... be a discrete time Markov chain with one-step transition probabilities being the same as those for the Brownian motion in D conditioned not to exit D before time 2k. We prove that the laws of Xk converge to that of the reflected Brownian motion on D. These approximation schemes give not only new ways of constructing reflected Brownian motion but also implementable algorithms to simulate reflected Brownian motion.


Full work available at URL: https://arxiv.org/abs/math/0611114




Recommendations




Cites Work


Cited In (24)





This page was built for publication: Discrete approximations to reflected Brownian motion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482284)