Relevant states and memory in Markov chain bootstrapping and simulation
From MaRDI portal
Publication:1752182
DOI10.1016/j.ejor.2016.06.006zbMath1394.90553OpenAlexW2120486698MaRDI QIDQ1752182
Paolo Falbo, Cristian Pelizzari, Roy Cerqueti
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://openresearch.lsbu.ac.uk/download/6066f6adc94dc7b0c9c2418ef24e5cbaf89e262eac2bec58a04d59db77e55abf/734277/Main%20document%20CPL.pdf
Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Markov processes: estimation; hidden Markov models (62M05) Nonparametric statistical resampling methods (62G09) Markov and semi-Markov decision processes (90C40)
Related Items (5)
A blockchain prediction model on time, value, and purchase based on Markov chain and queuing theory in stock trade ⋮ A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping ⋮ On universal algorithms for classifying and predicting stationary processes ⋮ Approximating multivariate Markov chains for bootstrapping through contiguous partitions ⋮ Approximating Markov Chains for Bootstrapping and Simulation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov state models for rare events in molecular dynamics
- New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system
- Simulation-based optimization of Markov decision processes: an empirical process theory approach
- Approximation of Markov decision processes with general state space
- A nonparametric plug-in rule for selecting optimal block lengths for block bootstrap methods
- Bootstrap in Markov-sequences based on estimates of transition density
- On bootstrapping two-stage least-squares estimates in stationary linear models
- Equivalence notions and model minimization in Markov decision processes
- Regenerative block-bootstrap for Markov chains
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification
- Markov decision processes with multidimensional action spaces
- Resampling a coverage pattern
- Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy
- The use of subseries values for estimating the variance of a general statistic from a stationary sequence
- Modeling by shortest data description
- Bootstrapping Markov chains: Countable case
- A general resampling scheme for triangular arrays of \(\alpha\)-mixing random variables with application to the problem of spectral density estimation
- Estimating the dimension of a model
- Bootstrap methods: another look at the jackknife
- Countable state Markov process bootstrap
- Sieve bootstrap for time series
- Resampling methods for dependent data
- Block length selection in the bootstrap for time series
- Infinite horizon Markov decision processes with unknown or variable discount factors
- The jackknife and the bootstrap for general stationary observations
- The consistency of the BIC Markov order estimator.
- The local bootstrap for Markov processes
- Entropy, divergence and distance measures with econometric applications
- On functional equations for \(K\)th best policies in Markov decision processes
- Variable length Markov chains
- Production and availability policies through the Markov decision process and myopic methods for contractual and selective orders
- Second-order properties of regeneration-based bootstrap for atomic Markov chains
- Higher-order multivariate Markov chains and their applications
- A tabu search heuristic procedure in Markov chain bootstrapping
- Tapered block bootstrap
- Asymptotic bootstrap validity for finite markov chains
- Order Estimation of Markov Chains
- A universal data compression system
- Complexity of strings in the class of Markov sources
- Universal modeling and coding
- Estimating the number of states of a finite-state source
- A sequential algorithm for the universal coding of finite memory sources
- Universal prediction of individual sequences
- Regeneration-based bootstrap for Markov chains
- Strongly consistent code-based identification and order estimation for constrained finite-state model classes
- The Stationary Bootstrap
- Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
- Automatic Block-Length Selection for the Dependent Bootstrap
- Sieve Bootstrap With Variable-Length Markov Chains for Stationary Categorical Time Series
- The tapered block bootstrap for general statistics from stationary sequences
- Large-scale typicality of Markov sample paths and consistency of MDL order estimators
- The minimum description length principle in coding and modeling
- On the estimation of the order of a Markov chain and universal data compression
- A MARKOVIAN LOCAL RESAMPLING SCHEME FOR NONPARAMETRIC ESTIMATORS IN TIME SERIES ANALYSIS
- Bayesian Hypothesis Testing: A Reference Approach
- A universal finite memory source
- On blocking rules for the bootstrap with dependent data
- Bootstrap Methods for Markov Processes
- Markov decision processes
This page was built for publication: Relevant states and memory in Markov chain bootstrapping and simulation
