Research Article Open Access

Computational Discrete Time Markov Chain with Correlated Transition Probabilities

Peerayuth Charnsethikul

Abstract

This study presents a computational procedure for analyzing statistics of steady state probabilities in a discrete time Markov chain with correlations among their transition probabilities. The proposed model simply uses the first order Taylor’s series expansion and statistical expected value properties to obtain the resulting linear matrix equations system. Computationally, the bottleneck is O(n4) but can be improved by distributed and parallel processing. A preliminary computational experience is reported.

Journal of Mathematics and Statistics
Volume 2 No. 4, 2006, 457-459

DOI: https://doi.org/10.3844/jmssp.2006.457.459

Submitted On: 5 November 2006 Published On: 31 December 2007

How to Cite: Charnsethikul, P. (2006). Computational Discrete Time Markov Chain with Correlated Transition Probabilities. Journal of Mathematics and Statistics, 2(4), 457-459. https://doi.org/10.3844/jmssp.2006.457.459

  • 2,593 Views
  • 2,994 Downloads
  • 0 Citations

Download

Keywords

  • Markov chain
  • steady state analysis
  • correlated transition probabilities
  • computational methods