Theorem 4.2.3. If a recurrent class C in a finite-state Markov chain has period d, then the states in C can be partitioned into d subsets, S1, S2, . . . , Sd, in such a way that all transitions from S1go to S2, all from S2go to S3, and so forth up to Sd1to Sd. Finally, all transitions from Sdgo to S1.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here