Bootstrap methods for Markov processes

Research output: Contribution to journalArticlepeer-review

74 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)1049-1082
Number of pages34
Issue number4
StatePublished - 2003


  • Asymptotic refinement
  • Edgeworth expansion
  • Resampling
  • Time series

ASJC Scopus subject areas

  • Economics and Econometrics


Dive into the research topics of 'Bootstrap methods for Markov processes'. Together they form a unique fingerprint.

Cite this