AbstractThe main aim of this paper is to examine the applicability of generalized inverses to a wide variety of problems in applied probability where a Markov chain is present either directly or indirectly through some form of imbedding. By characterizing all generalized inverses of I—P, where P is the transition matrix of a finite irreducible discrete time Markov chain, we are able to obtain general procedures for finding stationary distributions, moments of the first passage time distributions, and asymptotic forms for the moments of the occupation-time random variables. It is shown that all known explicit methods for examining these problems can be expressed in this generalized inverse framework. More generally, in the context of a Marko...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
Based upon the Grassman, Taksar and Heyman algorithm [1] and the equivalent Sheskin State Reduction ...
In this paper we carry over the concept of reverse probabilistic representations developed in Milste...
AbstractThe main aim of this paper is to examine the applicability of generalized inverses to a wide...
In many stochastic models a Markov chain is present either directly or indirectly through some form ...
AbstractParametric forms for multicondition generalized inverses of I - P, where P is the transition...
AbstractA systematic investigation of the various multicondition generalized inverses of I – P, wher...
Markov chains are considered with emphasis on the compution of exact and approximate stationary dist...
Computational procedures for the stationary probability distribution, the group inverse of the Marko...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
AbstractA number of important theorems arising in connection with Gaussian elimination are derived, ...
AbstractA direct method based on oblique projections is adapted to compute the stationary distributi...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
We study the solutions of the inverse problem g(z)=∫f(y)P T(z,dy)for a given g, where (P t(⋅,⋅)) t≥0...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
Based upon the Grassman, Taksar and Heyman algorithm [1] and the equivalent Sheskin State Reduction ...
In this paper we carry over the concept of reverse probabilistic representations developed in Milste...
AbstractThe main aim of this paper is to examine the applicability of generalized inverses to a wide...
In many stochastic models a Markov chain is present either directly or indirectly through some form ...
AbstractParametric forms for multicondition generalized inverses of I - P, where P is the transition...
AbstractA systematic investigation of the various multicondition generalized inverses of I – P, wher...
Markov chains are considered with emphasis on the compution of exact and approximate stationary dist...
Computational procedures for the stationary probability distribution, the group inverse of the Marko...
AbstractFor finite irreducible discrete time Markov chains, whose transition probabilities are subje...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
AbstractA number of important theorems arising in connection with Gaussian elimination are derived, ...
AbstractA direct method based on oblique projections is adapted to compute the stationary distributi...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
We study the solutions of the inverse problem g(z)=∫f(y)P T(z,dy)for a given g, where (P t(⋅,⋅)) t≥0...
Questions are posed regarding the influence that the column sums of the transition probabilities of ...
Based upon the Grassman, Taksar and Heyman algorithm [1] and the equivalent Sheskin State Reduction ...
In this paper we carry over the concept of reverse probabilistic representations developed in Milste...