Abstract
In this work we develop a bootstrap method based on the theory of Markov chains. The method moves from the two competing objectives that a researcher pursues when performing a bootstrap procedure: (i) to preserve the structural similarity – in statistical sense – between the original and the bootstrapped sample; (ii) to assure a diversification of the latter with respect to the former. The original sample is assumed to be driven by a Markov chain. The approach we follow is to implement an optimization problem to estimate the memory of a Markov chain (i.e. its order) and to identify its relevant states. The basic ingredients of the model are the transition probabilities, whose distance is measured through a suitably defined functional. We apply the method to the series of electricity prices in Spain. A comparison with the Variable Length Markov Chain bootstrap, which is a well established bootstrap method, shows the superiority of our proposal in reproducing the dependence among data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anatolyev S, Vasnev A (2002) Markov chain approximation in bootstrapping autoregressions. Econ Bull 3(19):1–8
Athreya KB, Fuh CD (1992) Bootstrapping Markov chains: countable case. J Stat Plan Inference 33(3):311–331
Bertail P, Clémençon S (2007) Second-order properties of regeneration-based bootstrap for atomic Markov chains. Test 16:109–122
Bühlmann P (1997) Sieve bootstrap for time series. Bernoulli 3(2):123–148
Bühlmann P, Wyner AJ (1999) Variable length Markov chains. Ann Stat 27(2):480–513
Cerqueti R, Falbo P, Guastaroba G, Pelizzari C (2013) A tabu search heuristic procedure in Markov chain bootstrapping. Eur J Oper Res 227(2):367–384
Cerqueti R, Falbo P, Pelizzari C (2010) Relevant states and memory in Markov chain bootstrapping and simulation. Munich Personal RePEc Archive Paper 46254, University Library of Munich, Germany
Cerqueti R, Falbo P, Pelizzari C, Ricca F, Scozzari A (2012) A mixed integer linear programming approach to Markov chain bootstrapping. Quaderni del Dipartimento di Economia e Diritto dell’Università degli Studi di Macerata, n. 67, Università degli Studi di Macerata, Macerata, Italy
Ching W-K, Ng MK, Fung ES (2008) Higher-order multivariate Markov chains and their applications. Linear Algebra Appl 428(2-3):492–507
Efron B (1979) Bootstrap methods: another look at the jackknife. Ann Stat 7(1):1–26
Horowitz JL (2003) Bootstrap methods for Markov processes. Econometrica 71(4):1049–1082
Kolmogorov AN (1965) Three approaches to the quantitative definition of information. Probl Inf Transm 1(1):3–11
Paparoditis E, Politis DN (2001) Tapered block bootstrap. Biometrika 88(4):1105–1119
Paparoditis E, Politis DN (2001) A Markovian local resampling scheme for nonparametric estimators in time series analysis. Econom Theory 17(3):540–566
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Cerqueti, R., Falbo, P., Guastaroba, G., Pelizzari, C. (2015). Approximating Markov Chains for Bootstrapping and Simulation. In: Steland, A., Rafajłowicz, E., Szajowski, K. (eds) Stochastic Models, Statistics and Their Applications. Springer Proceedings in Mathematics & Statistics, vol 122. Springer, Cham. https://doi.org/10.1007/978-3-319-13881-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-13881-7_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13880-0
Online ISBN: 978-3-319-13881-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)