Relevant States and Memory in Markov Chain Bootstrapping and Simulation
Markov 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.
|Date of creation:||2013|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
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.:
- White, D. J., 1987. "Infinite horizon Markov decision processes with unknown or variable discount factors," European Journal of Operational Research, Elsevier, vol. 28(1), pages 96-100, January.
- 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-1764, 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.
- 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.
- 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;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 109-122, May.
- Paparoditis, Efstathios & Politis, Dimitris N., 2001. "A Markovian Local Resampling Scheme For Nonparametric Estimators In Time Series Analysis," Econometric Theory, Cambridge University Press, vol. 17(03), pages 540-566, June.
- Hall, Peter, 1985. "Resampling a coverage pattern," Stochastic Processes and their Applications, Elsevier, vol. 20(2), pages 231-246, September.
- Pandelis, Dimitrios G., 2010. "Markov decision processes with multidimensional action spaces," European Journal of Operational Research, Elsevier, vol. 200(2), pages 625-628, January.
- Joel L. Horowitz, 2003. "Bootstrap Methods for Markov Processes," Econometrica, Econometric Society, vol. 71(4), pages 1049-1082, 07.
- Efstathios Paparoditis & Dimitris N. Politis, 2002. "The tapered block bootstrap for general statistics from stationary sequences," Econometrics Journal, Royal Economic Society, vol. 5(1), pages 131-148, June.
- Dimitris Politis & Halbert White, 2004. "Automatic Block-Length Selection for the Dependent Bootstrap," Econometric Reviews, Taylor & Francis Journals, vol. 23(1), pages 53-70.
- repec:ebl:ecbull:v:3:y:2002:i:19:p:1-8 is not listed on IDEAS
- 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;The Institute of Statistical Mathematics, vol. 42(2), pages 253-268, June.
- White, Chelsea C. & White, Douglas J., 1989. "Markov decision processes," European Journal of Operational Research, Elsevier, vol. 39(1), pages 1-16, March.
- 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.
- Chao, Gary H., 2013. "Production and availability policies through the Markov Decision Process and myopic methods for contractual and selective orders," European Journal of Operational Research, Elsevier, vol. 225(3), pages 383-392.
- Ohno, Katsuhisa & Boh, Toshitaka & Nakade, Koichi & Tamura, Takayoshi, 2016. "New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system," European Journal of Operational Research, Elsevier, vol. 249(1), pages 22-31.
- José M. Bernardo & Raúl Rueda, 2002. "Bayesian Hypothesis Testing: a Reference Approach," International Statistical Review, International Statistical Institute, vol. 70(3), pages 351-372, December.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:46250. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joachim Winter)
If references are entirely missing, you can add them using this form.