A simple proof of a theorem on Markov operators
Antoni Leon Dawidowicz, Andrzej Turski (1988)
Annales Polonici Mathematici
Similarity:
Antoni Leon Dawidowicz, Andrzej Turski (1988)
Annales Polonici Mathematici
Similarity:
Tomasz Szarek (1997)
Annales Polonici Mathematici
Similarity:
We prove a new sufficient condition for the asymptotic stability of Markov operators acting on measures. This criterion is applied to iterated function systems.
Zbyněk Šidák (1976)
Aplikace matematiky
Similarity:
Tomasz Szarek (2008)
Studia Mathematica
Similarity:
It is shown that Markov operators with equicontinuous dual operators which overlap supports have at most one invariant measure. In this way we extend the well known result proved for Markov operators with the strong Feller property by R. Z. Khas'minski.
Igor Melicherčík (1998)
Mathematica Slovaca
Similarity:
Bartosz Frej (2002)
Colloquium Mathematicae
Similarity:
On a compact metric space X one defines a transition system to be a lower semicontinuous map . 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. ...
Zbigniew S. Kowalski (2007)
Bulletin of the Polish Academy of Sciences. Mathematics
Similarity:
By using the skew product definition of a Markov chain we obtain the following results: (a) Every k-step Markov chain is a quasi-Markovian process. (b) Every piecewise linear map with a Markovian partition defines a Markov chain for every absolutely continuous invariant measure. (c) Satisfying the Chapman-Kolmogorov equation is not sufficient for a process to be quasi-Markovian.
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.
Anzelm Iwanik (1987)
Colloquium Mathematicum
Similarity:
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.
Franco Giannessi (2010)
RAIRO - Operations Research
Similarity:
A problem (arisen from applications to networks) is posed about the principal minors of the matrix of transition probabilities of a Markov chain.
Irada Dzhalladova, Miroslava Růžičková (2023)
Archivum Mathematicum
Similarity:
The work deals with non-Markov processes and the construction of systems of differential equations with delay that describe the probability vectors of such processes. The generating stochastic operator and properties of stochastic operators are used to construct systems that define non-Markov processes.