Papers
Topics
Authors
Recent
2000 character limit reached

Embedded Markov chain approximations in Skorokhod topologies

Published 16 Sep 2014 in math.PR | (1409.4656v2)

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 $J_1$, the linear interpolation embedding for $M_1$, the multi step embedding for $J_2$ and a more general embedding for $M_2$. We show that the convergence of the step function embedding in $J_1$ implies the convergence of the other embeddings in the corresponding topologies, respectively. For the converse statement a $J_1$-tightness condition for embedded Markov chains is given. The result relies on various representations of the Skorokhod topologies. Additionally it is shown that $J_1$ convergence is equivalent to the joint convergence in $M_1$ and $J_2$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.