3
$\begingroup$

How to proof that every positive Harris recurrent, aperiodic, stationary Markov chain is alpha-mixing (strong-mixing)?

$\endgroup$

1 Answer 1

3
$\begingroup$

In the following, all results are referenced from Bradley (2005).

Suppose that $X := (X_k, k \in \mathbb{Z})$ is a strictly stationary Markov chain. If $X$ is Harris recurrent and aperiodic then $X$ is $\beta$-mixing (Theorem 3.5), and hence $\alpha$-mixing (Section 2.1 or Theorem 3.2).

References

Bradley, Richard C. (2005), Basic Properties of Strong Mixing Conditions. A Survey and Some Open Questions. Probability Surveys 2, 107-144. doi: 10.1214/154957805100000104

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.