MCMC for Markov-switching models—Gibbs sampling vs. marginalized likelihood
From MaRDI portal
Publication:5082562
DOI10.1080/03610918.2019.1565580zbMath1489.62286OpenAlexW2911832412MaRDI QIDQ5082562
Tore Selland Kleppe, Kjartan Kloster Osmundsen, Atle Oglend
Publication date: 21 June 2022
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2019.1565580
Applications of statistics to economics (62P20) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Bayesian inference (62F15) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)
Uses Software
Cites Work
- Unnamed Item
- The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
- Striated Metropolis-Hastings sampler for high-dimensional models
- Methods for inference in large multiple-equation Markov-switching models
- Structural vector autoregressions with Markov switching
- Methods for measuring expectations and uncertainty in Markov-switching models
- Particle efficient importance sampling
- Calculating posterior distributions and modal estimates in Markov mixture models
- Dynamic linear models with Markov-switching
- Markov-switching vector autoregressions. Modelling, statistical inference, and application to business cycle analysis
- Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling
- Practical Markov Chain Monte Carlo
- Bartlett Decomposition and Wishart Distribution
- Evaluating Derivatives
- The Impact of Uncertainty Shocks
- A New Approach to the Economic Analysis of Nonstationary Time Series and the Business Cycle
- Bayesian Methods for Hidden Markov Models
- Dealing With Label Switching in Mixture Models
- Computational and Inferential Difficulties with Mixture Posterior Distributions
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- Particle Markov Chain Monte Carlo Methods
- Markov chain Monte Carlo Estimation of Classical and Dynamic Switching and Mixture Models
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
This page was built for publication: MCMC for Markov-switching models—Gibbs sampling vs. marginalized likelihood