Displaying similar documents to “Markov inequality on sets with polynomial parametrization”

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.

Reverse Markov inequality.

Levenberg, Norman, Poletsky, Evgeny A. (2002)

Annales Academiae Scientiarum Fennicae. Mathematica

Similarity:

A note on Markov operators and transition systems

Bartosz Frej (2002)

Colloquium Mathematicae

Similarity:

On a compact metric space X one defines a transition system to be a lower semicontinuous map X → 2 X . It is known that every Markov operator on C(X) induces a transition system on X and that commuting of Markov operators implies commuting of the induced transition systems. We show that even in finite spaces a pair of commuting transition systems may not be induced by commuting Markov operators. The existence of trajectories for a pair of transition systems or Markov operators is also investigated. ...

Simple Markov chains

O. Adelman (1976)

Annales scientifiques de l'Université de Clermont. Mathématiques

Similarity:

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.

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...