Abstract
Abstract The aim of this paper is to show that for a wide class of stationary ARMA processes Rissanen's predictive stochastic complexity is asymptotically equal to the lower bound provided by the Rissanen-Shannon inequality almost surely. An analogous theorem is proved for a more easily computable version of the predictive stochastic complexity based on the recursive estimation of the ARMA parameters.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
