Markov Process Problem
Answer
We know that $P=P \Pi $. Also note that $P$ is a $1\times n$ matrix aka a row vector. So the k-th component of $P$ is $P$ times the k-th column of $\Pi$ :
$$ p_k =\sum _{i=1}^n p_i \pi _{ik} = \sum _{i=1}^n p_i \alpha = \alpha \sum _{i=1}^n p_i =\alpha 1=\alpha $$ since $P$ is a probability distribution and the sum of its components is one.
The interpretation is that if the probability of reaching the state $x_k$ from any state is the constant $\alpha$, then in the stationery distribution, which is the same as the probability distribution in the long run, the probability of being in the state $x_k$ is also $\alpha$.
The answer is accepted.
- answered
- 146 views
- $24.00
Related Questions
- [Discrete Mathematics] Big-O Notation
- How many balanced lists of n left and n right parentheses are there?
- Finding a unique structure of the domain of a function that gives a unique intuitive average?
- Logic quesiton A v ¬A
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Discete Math
- Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶