On Finitary Coding of Topological Markov Chains
Wolfgang Krieger (1981)
Recherche Coopérative sur Programme n°25
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Wolfgang Krieger (1981)
Recherche Coopérative sur Programme n°25
Similarity:
Wolfgang Krieger (1980)
Inventiones mathematicae
Similarity:
Wolfgang Krieger, Joachim Cantz (1980)
Journal für die reine und angewandte Mathematik
Similarity:
O. Adelman (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Marcus, Brian, Tuncel, Selim (1999)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
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.
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.
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.
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...
Franco Giannessi (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A problem (arisen from applications to networks) is posed about the principal minors of the matrix of transition probabilities of a Markov chain.