2016
DOI: 10.1017/s0266466616000104
|View full text |Cite|
|
Sign up to set email alerts
|

Residual-Based Garch Bootstrap and Second Order Asymptotic Refinement

Abstract: The residual-based bootstrap is considered one of the most reliable methods for bootstrapping generalized autoregressive conditional heteroscedasticity (GARCH) models. However, in terms of theoretical aspects, only the consistency of the bootstrap has been established, while the higher order asymptotic refinement remains unproven. For example, Corradi and Iglesias (2008) demonstrate the asymptotic refinement of the block bootstrap for GARCH models but leave the results of the residual-based bootstrap as a conj… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 30 publications
0
12
0
Order By: Relevance
“…Pascual et al () exploit the recursive bootstrap for out‐of‐sample prediction. Jeong () considers asymptotic refinements of the recursive bootstrap for the GARCH(1,1) model by relying on Edgeworth expansions of t ‐statistics. Hall and Yao () propose a (‘ m out of n ’) recursive bootstrap in the heavy‐tailed case, where the distribution of the innovation is in the domain of attraction of a stable law.…”
Section: Introductionmentioning
confidence: 99%
“…Pascual et al () exploit the recursive bootstrap for out‐of‐sample prediction. Jeong () considers asymptotic refinements of the recursive bootstrap for the GARCH(1,1) model by relying on Edgeworth expansions of t ‐statistics. Hall and Yao () propose a (‘ m out of n ’) recursive bootstrap in the heavy‐tailed case, where the distribution of the innovation is in the domain of attraction of a stable law.…”
Section: Introductionmentioning
confidence: 99%
“…The recursive bootstrap scheme applied is standard in the context of GARCH models, see e.g. Hidalgo and Za¤aroni (2007) or Jeong (2017). The bootstrap algorithm is as follows:…”
Section: Bootstrap Algorithm For Testing Reduced Rankmentioning
confidence: 99%
“…However, the sacrifice is worthwhile, as the second-order correctness is unachievable anyway because of the non-smooth objective function in step 2. Actually, in the literature, bootstrap methods with second-order correctness are still limited to the GARCH.1, 1/ model and are unavailable for the general GARCH model (Corradi and Iglesias, 2008;Jeong, 2017).…”
Section: A Mixed Bootstrapping Proceduresmentioning
confidence: 99%