Efficiency of finite state space Monte Carlo Markov chains
From MaRDI portal
Publication:5953883
Recommendations
- Ordering and improving the performance of Monte Carlo Markov chains.
- Stationarity preserving and efficiency increasing probability mass transfers made possible
- Algorithms for improving efficiency of discrete Markov chains
- Markov chain Monte Carlo on finite state spaces
- General state space Markov chains and MCMC algorithms
Cites work
- scientific article; zbMATH DE number 1222286 (Why is no real title available?)
- scientific article; zbMATH DE number 472922 (Why is no real title available?)
- scientific article; zbMATH DE number 1560252 (Why is no real title available?)
- A note on Metropolis-Hastings kernels for general state spaces
- Accelerating Gaussian diffusions
- Analysis of a nonreversible Markov chain sampler.
- Markov chains for exploring posterior distributions. (With discussion)
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- Optimum Monte-Carlo sampling using Markov chains
Cited in
(9)- Dependence ordering for Markov processes on partially ordered spaces
- The order of degeneracy of Markov chain Monte Carlo method
- Algorithms for improving efficiency of discrete Markov chains
- Designing simple and efficient Markov chain Monte Carlo proposal kernels
- Stationarity preserving and efficiency increasing probability mass transfers made possible
- Variance reduction for diffusions
- scientific article; zbMATH DE number 927299 (Why is no real title available?)
- Improving the convergence of reversible samplers
- Ordering and improving the performance of Monte Carlo Markov chains.
This page was built for publication: Efficiency of finite state space Monte Carlo Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953883)