Abstract
Abstract The paper considers the Markov-Switching GARCH(1,1)-model with time-varying transition probabilities. It derives sufficient conditions for the square of the process to display long memory and provides some additional intuition for the empirical observation that estimated GARCH-parameters often sum to almost one.
Sign-in/Register to access full text options 
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.
