What you’ll work on
- Matrices
Start with the idea
A column transition matrix T uses each column to describe where people in one current state move next. Then Sn+1=TSn.
Check that probability columns sum to 1. A stable state satisfies TS=S, but a sequence need not converge for every possible transition matrix.
A worked example
T=[[0.8, 0.3], [0.2, 0.7]], S0=[[50], [50]]. Find S1.
- New first state=0.8×50+0.3×50
- second=0.2×50+0.7×50.
Answer: [[55], [45]].
Try one question
For T=[[0.9, 0.4], [0.1, 0.6]], explain entry 0.4.
Show answer and explanation
40% of state 2 moves to state 1 per step.
Columns are origins and rows are destinations.
Inside the collection
| Resource | Length | Practice | Answers |
|---|---|---|---|
| Learn and practise | 4 pages | 4 questions | Included |
| Apply and extend | 4 pages | 4 questions | Included |
| Topic checkpoint | 3 pages | 4 questions | Included |
Read on a device and work in an exercise book, or print the A4 PDFs. These files are not auto-marked digital quizzes.