- IB
- Question Type 1: Construction transition matrices from diagrams or context descriptions
Construct the transition matrix for a Markov chain with states Sunny (S) and Rainy (R), given that if it is Sunny today it stays Sunny tomorrow with probability 0.8 and becomes Rainy with probability 0.2, and if it is Rainy today it becomes Sunny with probability 0.5 and stays Rainy with probability 0.5.
A gambler’s fortune has three levels: Low (L), Medium (M), High (H). If at L, he stays at L with probability 0.4 or moves to M with probability 0.6. From M he stays at M with probability 0.5, moves to H with probability 0.3, or to L with probability 0.2. From H he stays at H with probability 0.3 or moves to M with probability 0.7. Construct the transition matrix in the order (L,M,H).
In a cohort of 100 students each year, transitions between courses Math (M), Physics (P) and Chemistry (C) occur as follows: of those in M, 50 stay in M, 30 move to P, 20 to C; of those in P, 20 to M, 60 stay, 20 to C; of those in C, 10 to M, 30 to P, 60 stay. Construct the transition matrix with states (M,P,C).
A customer moves among four shops A, B, C, D. From A they stay in A with 0.1, go to B with 0.4, C with 0.3, D with 0.2. From B they stay with 0.2, go to A with 0.2, C with 0.5, D with 0.1. From C they stay with 0, go to A with 0.3, B with 0.3, D with 0.4. From D they stay with 0.25, go to A with 0.25, B with 0.25, C with 0.25. Construct the transition matrix in order (A,B,C,D).