Objectives_template

Module 1:Concepts of Random walks, Markov Chains, Markov Processes

Lecture 4:Markov Process

	Assignments 1.8 Consider the problem (you have already solved a part of it) as given, in which there are three (3) outcomes, such that the outcomes of any trails are dependent on the outcomes of the previous trial, and the transition probability matrix is given as . There are three (3) states given by 0, 1, 2, such that , and , and . With this information find (i) and , where . Assignment 1.9 Consider the problem (you have already solved a part of it) as given, in which there are three (3) outcomes, such that the outcomes of any trails are dependent on the outcomes of the previous trial, and the transition probability matrix is given as . There are three (3) states given by -1, 0, +1, such that , and , and . With this information find (i) and , where .