paper

Embedded Markov chain approximations in Skorokhod topologies

arXiv:1409.4656 · doi:10.19195/0208-4147.39.2.2

Abstract

In order to approximate a continuous time stochastic process by discrete time Markov chains one has several options to embed the Markov chains into continuous time processes. On the one hand there is the Markov embedding, which uses exponential waiting times. On the other hand each Skorokhod topology naturally suggests a certain embedding. These are the step function embedding for , the linear interpolation embedding for , the multi step embedding for and a more general embedding for . We show that the convergence of the step function embedding in implies the convergence of the other embeddings in the corresponding topologies, respectively. For the converse statement a -tightness condition for embedded Markov chains is given. The result relies on various representations of the Skorokhod topologies. Additionally it is shown that convergence is equivalent to the joint convergence in and .

arXiv commentTo appear in Probability and Mathematical Statistics