Stationary probabilities of Markov chains with upper Hessenberg transition matrices

Stationary probabilities of Markov chains with upper Hessenberg transition matrices

0.00 Avg rating0 Votes
Article ID: iaor1998456
Country: Canada
Volume: 35
Issue: 3
Start Page Number: 133
End Page Number: 143
Publication Date: Aug 1997
Journal: INFOR
Authors: ,
Keywords: markov processes, computational analysis, stochastic processes, matrices
Abstract:

In this paper, based on probabilistic arguments, we obtain an explicit solution of the stationary distribution for a discrete time Markov chain with an upper Hessenberg time stationary transition probability matrix. Our solution then leads to a numerically stable and efficient algorithm for computing stationary probabilities. Two other expressions for the stationary distribution are also derived, which lead to two alternative algorithms. Numerical analysis of the algorithms is given, which shows the reliability and efficiency of the algorithms. Examples of applications are provided, including results of a discrete time state dependent batch arrive queueing model. The idea used in this paper can be generalized to deal with Markov chains with a more general structure.

Reviews

Required fields are marked *. Your email address will not be published.