Conditional Probability - Markov chain

AI Thread Summary
In the discussion on Markov chains, the focus is on the conditional distribution p(x_n|x_{n-1}) and its parameters. It is clarified that for K states of x_{n-1}, K-1 parameters are needed because the probabilities must sum to 1. This means that knowing K-1 probabilities allows for the determination of the K-th probability. The conversation emphasizes the efficiency of this parameterization in modeling discrete variables. Overall, the understanding of conditional probabilities in Markov chains is enhanced through this explanation.
Apteronotus
Messages
201
Reaction score
0
Hi,

I was reading about Markov chains and came across the following statement:

"The conditional distribution p(x_n|x_{n-1}) will be specified by a set of K-1 parameters for each of the K states of x_{n-1} giving a total of K(K-1) parameters."

In the above we have assumed that the observations are discrete variables having K states.

I understand that x_{n-1} can have K states, but why K-1 parameters for each state? And what are those parameters?

Thanks,
 
Physics news on Phys.org
There are K different probabilities in the set of values p(x_n|x_{n-1}) and you could call each of these numbers a parameter. Since these probabilities must sum to 1, you only have to specify K-1 of them and this will determine the value of "the last one".
 
Brilliant!

Thank you.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top