Relevant States and Memory in Markov Chain Bootstrapping and Simulation
AbstractMarkov chain theory is proving to be a powerful approach to bootstrap highly nonlinear time series. In this work we provide a method to estimate the memory of a Markov chain (i.e. its order) and to identify its relevant states. In particular the choice of memory lags and the aggregation of irrelevant states are obtained by looking for regularities in the transition probabilities. Our approach is based on an optimization model. More specifically we consider two competing objectives that a researcher will in general pursue when dealing with bootstrapping: preserving the “structural” similarity between the original and the simulated series and assuring a controlled diversification of the latter. A discussion based on information theory is developed to define the desirable properties for such optimal criteria. Two numerical tests are developed to verify the effectiveness of the method proposed here.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University Library of Munich, Germany in its series MPRA Paper with number 46250.
Date of creation: 2013
Date of revision:
Bootstrapping; Information Theory; Markov chains; Optimization; Simulation.;
Find related papers by JEL classification:
- C15 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - Statistical Simulation Methods: General
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C65 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Miscellaneous Mathematical Tools
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-04-20 (All new papers)
- NEP-ECM-2013-04-20 (Econometrics)
- NEP-ETS-2013-04-20 (Econometric Time Series)
- NEP-ORE-2013-04-20 (Operations Research)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Joel L. Horowitz, 2003. "Bootstrap Methods for Markov Processes," Econometrica, Econometric Society, vol. 71(4), pages 1049-1082, 07.
- Brock, William & Lakonishok, Josef & LeBaron, Blake, 1992.
" Simple Technical Trading Rules and the Stochastic Properties of Stock Returns,"
Journal of Finance,
American Finance Association, vol. 47(5), pages 1731-64, December.
- Brock, W. & Lakonishok, J. & Lebaron, B., 1991. "Simple Technical Trading Rules And The Stochastic Properties Of Stock Returns," Working papers 90-22, Wisconsin Madison - Social Systems.
- Patrice Bertail & Stéphan Clémençon, 2007. "Second-order properties of regeneration-based bootstrap for atomic Markov chains," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 16(1), pages 109-122, May.
- Allan Timmermann & Halbert White & Ryan Sullivan, 1998.
"Data-Snooping, Technical Trading, Rule Performance and the Bootstrap,"
FMG Discussion Papers
dp303, Financial Markets Group.
- Ryan Sullivan & Allan Timmermann & Halbert White, 1999. "Data-Snooping, Technical Trading Rule Performance, and the Bootstrap," Journal of Finance, American Finance Association, vol. 54(5), pages 1647-1691, October.
- Sullivan, Ryan & Timmermann, Allan G & White, Halbert, 1998. "Data-Snooping, Technical Trading Rule Performance and the Bootstrap," CEPR Discussion Papers 1976, C.E.P.R. Discussion Papers.
- Buhlmann, Peter & Kunsch, Hans R., 1999. "Block length selection in the bootstrap for time series," Computational Statistics & Data Analysis, Elsevier, vol. 31(3), pages 295-310, September.
- Stanislav Anatolyev & Andrey Vasnev, 2002. "Markov chain approximation in bootstrapping autoregressions," Economics Bulletin, AccessEcon, vol. 3(19), pages 1-8.
- M. Rajarshi, 1990. "Bootstrap in Markov-sequences based on estimates of transition density," Annals of the Institute of Statistical Mathematics, Springer, vol. 42(2), pages 253-268, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.