Abstract

We analyze the eigenstructure of count-data Markov chains. Our main focus is on so-called CLAR(1) models, which are characterized by having a linear conditional mean, and also on the case of a finite range, where the second largest eigenvalue determines the speed of convergence of the forecasting distributions. We derive a lower bound for the second largest eigenvalue, which often (but not always) even equals this eigenvalue. This becomes clear by deriving the complete set of eigenvalues for several specific cases of CLAR(1) models.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call