“…and in the case of an irreducible and aperiodic chain, the transition matrix from time 0 to time n tends to an ergodic matrix, therefore if 7r is the stationary distribution probability vector, In this special case of nonhomogeneous Markov chains [22,23], the transition probabilities have a periodical behavior, that is they may vary but remain constant from one period to another: this special feature is called cyclicity. The transition function (p~(i,j); n E N, i,j E E) is called cyclic of period d (d > 1), if d is the smallest integer verifying Prnd+r : Pr for m,r E N. The major benefit of these chains is that an asymptotic analysis is possible due to their eventual weak ergodicity.…”