On Dimensional Functions and Topological Markov Chains.
Wolfgang Krieger (1980)
Inventiones mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Wolfgang Krieger (1980)
Inventiones mathematicae
Similarity:
Wolfgang Krieger (1981)
Recherche Coopérative sur Programme n°25
Similarity:
Joachim Cuntz, Wolfgang Krieger (1980)
Inventiones mathematicae
Similarity:
Sorin Popa (1993)
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:
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.
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.
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...