Abstract

A Markov modulated Markov process is a doubly stochastic finite-alphabet continuous-time random process with an underlying hidden Markov chain and an observable conditionally Markov chain. Explicit forward recursions are developed for the conditional mean estimators of the state, number of jumps, and total sojourn time of the underlying chain, and for the conditional number of jumps and total sojourn time of the observable process given any state of the underlying chain. The recursions are derived using the transformation of measure approach, and their explicit forms follow from vectorization and Van Loan's formula for integration of matrix exponentials. The recursions are applicable to Markov modulated Poisson processes. Numerical results from applications of these recursions are also provided.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.