Approximating Markov chains for bootstrapping and simulation
From MaRDI portal
Recommendations
- Relevant states and memory in Markov chain bootstrapping and simulation
- A tabu search heuristic procedure in Markov chain bootstrapping
- Approximating multivariate Markov chains for bootstrapping through contiguous partitions
- A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping
- Bootstrap Methods for Markov Processes
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- A MARKOVIAN LOCAL RESAMPLING SCHEME FOR NONPARAMETRIC ESTIMATORS IN TIME SERIES ANALYSIS
- A tabu search heuristic procedure in Markov chain bootstrapping
- Bootstrap Methods for Markov Processes
- Bootstrap methods: another look at the jackknife
- Higher-order multivariate Markov chains and their applications
- Relevant states and memory in Markov chain bootstrapping and simulation
- Second-order properties of regeneration-based bootstrap for atomic Markov chains
- Separability Criterion for Density Matrices
- Sieve bootstrap for time series
- Tapered block bootstrap
- Variable length Markov chains
Cited in
(6)- Corrigendum to: ``Relevant states and memory in Markov chain bootstrapping and simulation
- Relevant states and memory in Markov chain bootstrapping and simulation
- Simulating tail asymptotics of a Markov chain
- A tabu search heuristic procedure in Markov chain bootstrapping
- Approximating multivariate Markov chains for bootstrapping through contiguous partitions
- A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping
This page was built for publication: Approximating Markov chains for bootstrapping and simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833388)