Displaying similar documents to “Entropy at a weight-per-symbol and embeddings of Markov chains.”

Borel isomorphism of SPR Markov shifts

Mike Boyle, Jérôme Buzzi, Ricardo Gómez (2014)

Colloquium Mathematicae

Similarity:

We show that strongly positively recurrent Markov shifts (including shifts of finite type) are classified up to Borel conjugacy by their entropy, period and their numbers of periodic points.

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.

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.

Why the Kemeny Time is a constant

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.

Process parameter prediction via markov models of sub-activities

Lino G. Marujo, Raad Y. Qassim (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This work aims to fill a lacunae in the project-oriented production systems literature providing a formal analytic description of the rework effects formulae and the determination of the extended design time due to a certain degree of overlapping in a pair of activities. It is made through the utilization of concepts of workflow construction with hidden (semi) Markov models theory and establishing a way to disaggregate activities into sub-activities, in order to determine the activity...