On the perturbation of Markov chains with nearly transient states.
G.W. Stewart (1993)
Numerische Mathematik
Similarity:
Displaying similar documents to “On a direct method for the solution of nearly uncoupled Markov chains.”
On the perturbation of Markov chains with nearly transient states.
Perturbation results for nearly uncoupled Markov chains with applications to iterative methods.
Jesse L. Barlow (1993)
Numerische Mathematik
Similarity:
Entrywise perturbation theory and error analysis for Markov chains.
Colm Art O'Cinneide (1993)
Numerische Mathematik
Similarity:
Simple Markov chains
O. Adelman (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Why the Kemeny Time is a constant
Karl Gustafson, Jeffrey J. Hunter (2016)
Special Matrices
Similarity:
We present a new fundamental intuition forwhy the Kemeny feature of a Markov chain is a constant. This new perspective has interesting further implications.
On the exchanges between Wolfgang Doeblin and Bohuslav Hostinský
Laurent Mazliak (2007)
Revue d'histoire des mathématiques
Similarity:
We present the letters sent by Wolfgang Doeblin to Bohuslav Hostinský between 1936 and 1938. They concern some aspects of the general theory of Markov chains and the solutions of the Chapman-Kolmogorov equation that Doeblin was then establishing for his PhD thesis.
Conditional Markov chains - construction and properties
Tomasz R. Bielecki, Jacek Jakubowski, Mariusz Niewęgłowski (2015)
Banach Center Publications
Similarity:
In this paper we study finite state conditional Markov chains (CMCs). We give two examples of CMCs, one which admits intensity, and another one, which does not admit an intensity. We also give a sufficient condition under which a doubly stochastic Markov chain is a CMC. In addition we provide a method for construction of conditional Markov chains via change of measure.
Bibliography on Markov chains with a general state space
Zbyněk Šidák (1976)
Aplikace matematiky
Similarity:
Accurate calculations of Stationary Distributions and Mean First Passage Times in Markov Renewal Processes and Markov Chains
Jeffrey J. Hunter (2016)
Special Matrices
Similarity:
This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30, 197–207, (1986) procedure. The technique is numerically stable in that it doesn’t involve subtractions. Algebraic expressions for the special cases of one, two, three and four states are derived.Aconsequence of the procedure is that the stationary distribution of the...