Chapter 2 Practice question 2.2

Discussion in 'CS2' started by Akansha, Sep 4, 2021.

  1. Akansha

    Akansha Active Member

    In this question, we can conclude that markov chain is irreducible.
    If a markov chain is irreducible then all it's states are aperiodic.
    And A state is said to be periodic if return to state is possible in no of steps that is a multiple of d, with d>1.
    Since it is aperiodic shouldn't be the period 0 or 1?
     
  2. Dave Johnson

    Dave Johnson ActEd Tutor Staff Member

    Hi

    Your second line is incorrect - a Markov chain can be irreducible and not aperiodic. Indeed this question provides an example if of this.
    • Each state can be reached from any other hence it is irreducible
    • However return to any starting state can only be done in an even number of steps, and it turns out the highest common factor for return times is 2 - hence this system has period 2
    Dave
     

Share This Page