| A) Markov Property | |
|---|---|
| 1) Analyzing the Markov Property | Ex 1 Ex 2 Ex 3 Ex 4 |
| 2) Modeling a Simple Transition | Ex 5 Ex 6 Ex 7 Ex 8 |
| 3) Analyzing the Probabilistic Graphs | Ex 9 Ex 10 Ex 11 Ex 12 |
| 4) Reading Probabilistic Graphs | Ex 13 Ex 14 |
| 5) Constructing Transition Diagrams | Ex 15 Ex 16 Ex 17 Ex 18 |
| B) Matrix Formalism | |
| 6) Analyzing the Matrix Representation | Ex 19 Ex 20 Ex 21 Ex 22 Ex 23 Ex 24 |
| 7) Defining and Validating Probability Vectors | Ex 25 Ex 26 Ex 27 Ex 28 |
| 8) Constructing and Reading Transition Matrices | Ex 29 Ex 30 Ex 31 Ex 32 Ex 33 Ex 34 |
| C) Evolution of the System | |
| 9) Analyzing the Evolution of a Markov Chain | Ex 35 Ex 36 Ex 37 Ex 38 Ex 39 Ex 40 |
| 10) Calculating and Predicting States after One Step | Ex 41 Ex 42 Ex 43 |
| 11) Calculating and Predicting States after Two Steps | Ex 44 Ex 45 |
| 12) Calculating Successive Distributions | Ex 46 Ex 47 Ex 48 Ex 49 |
| D) Steady State and Convergence | |
| 13) Analyzing Steady States and Convergence | Ex 50 Ex 51 Ex 52 Ex 53 Ex 54 Ex 55 |
| 14) Calculating Steady States | Ex 56 Ex 57 |
| 15) From Probabilistic Graphs to Steady States | Ex 58 Ex 59 |