.png){kind=icon}
Return
Bootstrap methods for Markov processes
.png){kind=icon}
PRE
AI
DOI：10.1111/1468-0262.00439.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The block bootstrap is the best known bootstrap method for time-series data when the analyst does not have a parametric model that reduces the data generation process to simple random sampling. However, the errors made by the block bootstrap converge to zero only slightly faster than those made by first-order asymptotic approximations. This paper describes a bootstrap procedure for data that are generated by a Markov process or a process that can be approximated by a Markov process with sufficient accuracy. The procedure is based on estimating the Markov transition density nonparametrically. Bootstrap samples are obtained by sampling the process implied by the estimated transition density. Conditions are given under which the errors made by the Markov bootstrap converge to zero more rapidly than those made by the block bootstrap.
Keywords:
time series
resampling
asymptotic refinement
Edgeworth expansion
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
3.0K
Citations:
4.3W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSaveAN IMPROVED HETEROSKEDASTICITY AND AUTOCORRELATION CONSISTENT COVARIANCE-MATRIX ESTIMATOR.png)
ECONOMETRICA
ECONOMETRICAIF7.1
PREAI
ShareSaveShareSave
View more