Entropy rate

Information theory
Entropy Differential entropy Conditional entropy Joint entropy Mutual information Directed information Conditional mutual information Relative entropy Entropy rate Limiting density of discrete points
Asymptotic equipartition property Rate–distortion theory
Shannon's source coding theorem Channel capacity Noisy-channel coding theorem Shannon–Hartley theorem
v t e

In the mathematical theory of probability, the entropy rate or source information rate is a function assigning an entropy to a stochastic process.

For a strongly stationary process, the conditional entropy for latest random variable eventually tend towards this rate value.

A process ${\displaystyle X}$ with a countable index gives rise to the sequence of its joint entropies ${\displaystyle H_{n}(X_{1},X_{2},\dots X_{n})}$. If the limit exists, the entropy rate is defined as

${\displaystyle H(X):=\lim _{n\to \infty }{\tfrac {1}{n}}H_{n}.}$

Note that given any sequence ${\displaystyle (a_{n})_{n}}$ with ${\displaystyle a_{0}=0}$ and letting ${\displaystyle \Delta a_{k}:=a_{k}-a_{k-1}}$, by telescoping one has ${\displaystyle a_{n}={\textstyle \sum _{k=1}^{n}}\Delta a_{k}}$. The entropy rate thus computes the mean of the first ${\displaystyle n}$ such entropy changes, with ${\displaystyle n}$ going to infinity. The behaviour of joint entropies from one index to the next is also explicitly subject in some characterizations of entropy.

While ${\displaystyle X}$ may be understood as a sequence of random variables, the entropy rate ${\displaystyle H(X)}$ represents the average entropy change per one random variable, in the long term.

It can be thought of as a general property of stochastic sources - this is the subject of the asymptotic equipartition property.

A stochastic process also gives rise to a sequence of conditional entropies, comprising more and more random variables. For strongly stationary stochastic processes, the entropy rate equals the limit of that sequence

${\displaystyle H(X)=\lim _{n\to \infty }H(X_{n}|X_{n-1},X_{n-2},\dots X_{1})}$

The quantity given by the limit on the right is also denoted ${\displaystyle H'(X)}$, which is motivated to the extent that here this is then again a rate associated with the process, in the above sense.

Since a stochastic process defined by a Markov chain that is irreducible, aperiodic and positive recurrent has a stationary distribution, the entropy rate is independent of the initial distribution.

For example, consider a Markov chain defined on a countable number of states. Given its right stochastic transition matrix ${\displaystyle P_{ij}}$ and an entropy

${\displaystyle h_{i}:=-\sum _{j}P_{ij}\log P_{ij}}$

associated with each state, one finds

${\displaystyle \displaystyle H(X)=\sum _{i}\mu _{i}h_{i},}$

where ${\displaystyle \mu _{i}}$ is the asymptotic distribution of the chain.

In particular, it follows that the entropy rate of an i.i.d. stochastic process is the same as the entropy of any individual member in the process.

The entropy rate of hidden Markov models (HMM) has no known closed-form solution. However, it has known upper and lower bounds. Let the underlying Markov chain ${\displaystyle X_{1:\infty }}$ be stationary, and let ${\displaystyle Y_{1:\infty }}$ be the observable states, then we have$${\displaystyle H(Y_{n}|X_{1},Y_{1:n-1})\leq H(Y)\leq H(Y_{n}|Y_{1:n-1})}$$and at the limit of ${\displaystyle n\to \infty }$, both sides converge to the middle.^[1]

The entropy rate may be used to estimate the complexity of stochastic processes. It is used in diverse applications ranging from characterizing the complexity of languages, blind source separation, through to optimizing quantizers and data compression algorithms. For example, a maximum entropy rate criterion may be used for feature selection in machine learning.^[2]

• Information source (mathematics)
• Markov information source
• Asymptotic equipartition property
• Maximal entropy random walk - chosen to maximize entropy rate

• Cover, T. and Thomas, J. (1991) Elements of Information Theory, John Wiley and Sons, Inc., ISBN 0-471-06259-6 [1]