The non-locality of Markov chain approximations to two-dimensional diffusions

From MaRDI portal
Publication:1996948

DOI10.1016/J.MATCOM.2016.06.001zbMATH Open1484.60087arXiv1605.06348OpenAlexW2963740785MaRDI QIDQ1996948FDOQ1996948


Authors: C. Reisinger Edit this on Wikidata


Publication date: 1 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Abstract: In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We derive conditions on the diffusion coefficients which permit transition probabilities to match locally first and second moments. We derive a novel formula which expresses how the matching becomes more difficult for larger (absolute) correlations and strongly anisotropic processes, such that instantaneous moves to more distant neighbours on the lattice have to be allowed. Roughly speaking, for non-zero correlations, the distance covered in one timestep is proportional to the ratio of volatilities in the two directions. We discuss the implications to Markov decision processes and the convergence analysis of approximations to Hamilton-Jacobi-Bellman equations in the Barles-Souganidis framework.


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




Recommendations




Cites Work


Cited In (6)





This page was built for publication: The non-locality of Markov chain approximations to two-dimensional diffusions

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