Relevant states and memory in Markov chain bootstrapping and simulation
Journal article
Cerqueti, R., Falbo, P. and Pelizzari, C. (2017). Relevant states and memory in Markov chain bootstrapping and simulation. European Journal of Operational Research. 256 (1), pp. 163-177. https://doi.org/10.1016/j.ejor.2016.06.006
Authors | Cerqueti, R., Falbo, P. and Pelizzari, C. |
---|---|
Abstract | Markov chain theory is proving to be a powerful approach to bootstrap and simulate 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 and simulation: preserving the “structural” similarity between the original and the resampled 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 proposed method. |
Year | 2017 |
Journal | European Journal of Operational Research |
Journal citation | 256 (1), pp. 163-177 |
Publisher | Elsevier BV |
ISSN | 0377-2217 |
Digital Object Identifier (DOI) | https://doi.org/10.1016/j.ejor.2016.06.006 |
Web address (URL) | https://www.sciencedirect.com/science/article/pii/S037722171630426X?via%3Dihub |
Publication dates | |
Jan 2017 | |
Online | 15 Jun 2016 |
Publication process dates | |
Accepted | 04 Jun 2016 |
Deposited | 28 Feb 2020 |
Accepted author manuscript | License File Access Level Open |
https://openresearch.lsbu.ac.uk/item/89307
Download files
90
total views169
total downloads0
views this month2
downloads this month