Difference between revisions of "The Data Processing Inequality"
Jump to navigation
Jump to search
(Created page with "== Markovity == == The Data Processing Inequality == == Sufficient Statistics == == Fano's Inequality ==") |
|||
Line 1: | Line 1: | ||
== Markovity == | == Markovity == | ||
+ | A Markov Chain is a random process that describes a sequence of possible events where the probability of each event depends only on the outcome of the previous event. Thus, we say that <math>X, Y, Z</math> is a Markov chain in this order, denoted as: | ||
+ | |||
+ | {{NumBlk|::|<math>X \rightarrow Y \rightarrow Z</math>|{{EquationRef|1}}}} | ||
+ | |||
+ | If we can write: | ||
+ | |||
+ | {{NumBlk|::|<math>P\left(x, y, z\right) = P\left(z\mid y\right)\cdot P\left(y\mid x\right) \cdot P\left(x\right)</math>|{{EquationRef|2}}}} | ||
+ | |||
== The Data Processing Inequality == | == The Data Processing Inequality == |
Revision as of 09:59, 23 October 2020
Markovity
A Markov Chain is a random process that describes a sequence of possible events where the probability of each event depends only on the outcome of the previous event. Thus, we say that is a Markov chain in this order, denoted as:
-
(1)
-
If we can write:
-
(2)
-