Generating MCMC proposals by randomly rotating the regular simplex
From MaRDI portal
Publication:2111065
Recommendations
- Designing simple and efficient Markov chain Monte Carlo proposal kernels
- Regenerative Markov chain Monte Carlo for any distribution
- scientific article; zbMATH DE number 849926
- Optimal proposal distributions and adaptive MCMC
- scientific article; zbMATH DE number 1089130
- Fast MCMC sampling algorithms on polytopes
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- Efficient MCMC sampling in dynamic mixture models
Cites work
- scientific article; zbMATH DE number 3048077 (Why is no real title available?)
- A course in abstract harmonic analysis
- A multiple-try Metropolis-Hastings algorithm with tailored proposals
- An adaptive Metropolis algorithm
- Differentiating the pseudo determinant
- Equation of state calculations by fast computing machines
- Generation of Random Orthogonal Matrices
- Markov chains for exploring posterior distributions. (With discussion)
- Monte Carlo sampling methods using Markov chains and their applications
- On parallelizable Markov chain Monte Carlo algorithms with waste-recycling
- Optimal proposal distributions and adaptive MCMC
- Optimum Monte-Carlo sampling using Markov chains
- Scaling analysis of multiple-try MCMC methods
- Slice sampling. (With discussions and rejoinder)
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Weak convergence and optimal scaling of random walk Metropolis algorithms
This page was built for publication: Generating MCMC proposals by randomly rotating the regular simplex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111065)