2016 · 33 citations · 5 references
Natural SciencesMathematicsProbability TheoryStochastic ModelingStochastic ProcessesBootstrap MethodsErgodic TheoryMarkov ChainsMarkov ProcessesSampling TheorySimulation MethodsAsymptotic PropertiesBootstrap EstimationBootstrap Monte CarloFinite-state Markov ChainsFirst Hitting TimesHitting TimesState Transition MatrixTransition Probability Matrix
Consider a finite state discrete time ergodic Markov chain {X n , n ≥0} with unknown transition matrix P and state space S = {1,..., m}. The matrix P can be estimated by P n , the matrix of empirical transition rates. An estimator of the stationary distribution π or the distribution of the first hitting time of some state, say m, can be obtained by using P ^ n . However exact sampling distributions of the estimators are in general difficult to calculate. Here we use the boot strap technique to obtain approximation to these sampling distributions. It is shown that the boot-strap technique works in an asymptotic sense. Results are illustrated by some simulations.
5
Bootstrap Methods: Another Look at the Jackknife
B. Efron · The Annals of Statistics · 1979 · 17.4K citations · Full text
Statistical Inference for Markov Processes
Ronald Pyke, Patrick Billingsley · Technometrics · 1963 · 565 citations
The Central Limit Theorem for Markov Chains
Thomas G. Kurtz · The Annals of Probability · 1981 · 29 citations · Full text