Bootstrapping Markov chains: Countable case
DOI10.1016/0378-3758(92)90002-AzbMath0765.62078MaRDI QIDQ1205467
Cheng-Der Fuh, Krishna B. Athreya
Publication date: 1 April 1993
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
transition probability matrixcentral limit theoremmaximum likelihood estimatestationary probabilitybootstrap methodscountably infinite state spacedouble array of Markov chainshitting time distributionirreducible, aperiodic and positive recurrent Markov chainweak law
Asymptotic distribution theory in statistics (62E20) Markov processes: estimation; hidden Markov models (62M05) Nonparametric statistical resampling methods (62G09) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (25)
Cites Work
- Unnamed Item
- Bootstrapping general empirical measures
- Strong law for the bootstrap
- Bootstrap of the mean in the infinite variance case
- Some asymptotic theory for the bootstrap
- On the asymptotic accuracy of Efron's bootstrap
- Bootstrap methods: another look at the jackknife
- SOME ASYMPTOTIC DISTRIBUTION THEORY FOR MARKOV CHAINS WITH A DENUMERABLE NUMBER OF STATES
- The Lindeberg-Levy Theorem for Martingales
- On the range of recurrent Markov chains
- On the range of recurrent Markov chains
This page was built for publication: Bootstrapping Markov chains: Countable case