STAT333 Lecture Notes - Lecture 10: 2-Step Garage, Modular Arithmetic, Markov Chain
Document Summary
Q given 1 step transition matrix p epi how can we equation decide the n step transition probability i jes pijm plxn jlx. si. As a special case and their collection start with pig if square matrix. Pig bages 2 step transition matrix condition on what happens at time i. Ies plxzjlxo. ie y k opcxiklxo i ilxo d fzspcxiixi. tt. Ees pch i. xi k. xo. lk y k xo i. Ees plxe. it o i xi k epcxi klxo i. I using the same idea for any aim 0,42 pijntm pcx. tn l ko i. Eosrhum i xo i xm k a pum ki kofi. By definition put p pot p pas put pep. Pa put p p2 p p3 pin pm ly nth power of nth step tpm put ep b es. Rijn pkn i xo the one step tpm. 2 pay unorkou condition at possibilities time m can xm and sum up all.
