2.5. The two-state Markov process

FW Frederic von Wegner
request Request a Protocol
ask Ask a question
Favorite

The general concepts introduced above are easily applied to a two-state, first-order Markov process that can be written as

with transition rates p and q. The self-transition rate for AA is 1−p, and the rate of BB is 1−q. The complete transition matrix T reads

and has eigenvalues λ0 = 1 and λ1 = 1 − (p + q). The eigenvalue λ0 = 1 is assured by the Perron-Frobenius theorem as T is a stochastic matrix, i.e., jTij=1 for all i. The normalized positive eigenvector to λ0 is the equilibrium or stationary distribution pst of the process,

We set pA=qp+q and pB=pp+q. With the auxiliary functions φ, ψ : [0, 1] → ℝ defined as φ(x) = −xlogx and ψ(x) = φ(x)+φ(1−x), the analytical quantities Hpq, hpq and apq for the 2-state first-order Markov process acquire a very simple form.

The Shannon entropy of the 2-state Markov process is

Due to the Markov property, the entropy rate is hpq = H(Xn+1Xn) and evaluates to

The Markov property reduces the full expression for information storage I(Xn+1;Xn(k)) to apq = I(Xn+1; Xn):

The total entropy is conserved between active information storage and the entropy rate:

To validate the proposed approach, these analytical results will later be compared with numerical results of a hidden Markov process classified as first-order Markovian by the PAIF method.

Do you have any questions about this protocol?

Post your question to gather feedback from the community. We will also invite the authors of this article to respond.

post Post a Question
0 Q&A