Displaying similar documents to “On Markov Properties Of Finitely Presented Groups”

Gibbs states for non-irreducible countable Markov shifts

Andrei E. Ghenciu, Mario Roy (2013)

Fundamenta Mathematicae

Similarity:

We study Markov shifts over countable (finite or countably infinite) alphabets, i.e. shifts generated by incidence matrices. In particular, we derive necessary and sufficient conditions for the existence of a Gibbs state for a certain class of infinite Markov shifts. We further establish a characterization of the existence, uniqueness and ergodicity of invariant Gibbs states for this class of shifts. Our results generalize the well-known results for finitely irreducible Markov shifts. ...

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:

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

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.

Bottom-up modeling of domestic appliances with Markov chains and semi-Markov processes

Rajmund Drenyovszki, Lóránt Kovács, Kálmán Tornai, András Oláh, István Pintér (2017)

Kybernetika

Similarity:

In our paper we investigate the applicability of independent and identically distributed random sequences, first order Markov and higher order Markov chains as well as semi-Markov processes for bottom-up electricity load modeling. We use appliance time series from publicly available data sets containing fine grained power measurements. The comparison of models are based on metrics which are supposed to be important in power systems like Load Factor, Loss of Load Probability. Furthermore,...

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.