Approximate regenerative-block bootstrap for Markov chains

The (approximate) regenerative block-bootstrap for bootstrapping general Harris Markov chains has recently been developed. It is built on the renewal properties of the chain, or of a Nummelin extension of the latter. It has theoretical properties that surpass other existing methods within the Markovian framework. The practical issues related to the implementation of this specific resampling method are discussed. Various simulation studies for investigating its performance and comparing it to other bootstrap resampling schemes, standing as natural candidates in the Markov setting are presented.