Let {Xn,n ≥ 0} be a Homogeneous Markov Chain (MC) with Transition Probability matrix P. Then if there exists a probability vector Ï€, such that Ï€P = Ï€,
Then π is called Stationary Distribution or Steady State Distribution or Limiting Probability.
Here, π = (π1, π2, π3,......,πn ), then π1+ π2+ π3+......+πn = 1
Related Posts:
Then π is called Stationary Distribution or Steady State Distribution or Limiting Probability.
Here, π = (π1, π2, π3,......,πn ), then π1+ π2+ π3+......+πn = 1
Jump to Probability and Queuing Theory Index Page
Solved Problems of Limiting Probability
Solved Problem 1: Assume that a computer system is in any one of the three states: busy, idle and under repair respectively. denoted by 0,1,2. Observing its state at 2 pm each day, we get the Transition Probability matrix as:
Find out the third step TPM and also determine the Limiting Probability.
Related Posts:
- Stochastic Process- Definition, Specifications, and Classification
- Markov Chain: Definition and Representation with Solved Problems
- n-Step Transition Probability Matrix of a Two-state Markov Chain with Solved problems
- Classification Of States and Periodicity of Markov Chain with Solved Problems
- Birth Death Process
- Chapman-Kolmogorov Equation
Stationary Distribution | Steady State Distribution with Solved Problems
Reviewed by Sandesh Shrestha
on
25 June
Rating:
No comments: