On Finitary Coding of Topological Markov Chains
Wolfgang Krieger (1981)
Recherche Coopérative sur Programme n°25
Similarity:
Wolfgang Krieger (1981)
Recherche Coopérative sur Programme n°25
Similarity:
Wolfgang Krieger (1980)
Inventiones mathematicae
Similarity:
O. Adelman (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
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.
Wolfgang Krieger (1979)
Mathematische Zeitschrift
Similarity:
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.
Mariusz Górajski (2009)
Annales UMCS, Mathematica
Similarity:
In this paper we consider an absorbing Markov chain with finite number of states. We focus especially on random walk on transient states. We present a graph reduction method and prove its validity. Using this method we build algorithms which allow us to determine the distribution of time to absorption, in particular we compute its moments and the probability of absorption. The main idea used in the proofs consists in observing a nondecreasing sequence of stopping times. Random walk on...
Raúl Montes-de-Oca, Alexander Sakhanenko, Francisco Salem-Silva (2003)
Applicationes Mathematicae
Similarity:
We analyse a Markov chain and perturbations of the transition probability and the one-step cost function (possibly unbounded) defined on it. Under certain conditions, of Lyapunov and Harris type, we obtain new estimates of the effects of such perturbations via an index of perturbations, defined as the difference of the total expected discounted costs between the original Markov chain and the perturbed one. We provide an example which illustrates our analysis.
Kalashnikov, Vladimir V. (1994)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
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...