An Extension of the Metropolis Algorithm
From MaRDI portal
Recommendations
Cites work
- A note on Metropolis-Hastings kernels for general state spaces
- Comparison theorems for reversible Markov chains
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Geometric bounds for eigenvalues of Markov chains
- Markov chains for exploring posterior distributions. (With discussion)
- Matrix Analysis
- Miscellanea. Peskun's theorem and a modified discrete-state Gibbs sampler
- Monte Carlo sampling methods using Markov chains and their applications
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- On the Rate of Convergence for Countable Markov Chains
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- Optimum Monte-Carlo sampling using Markov chains
- Ordering and improving the performance of Monte Carlo Markov chains.
- Rao-Blackwellisation of sampling schemes
- SPECTRAL OPERATORS IN A DIRECT SUM OF HILBERT SPACES
- Statistical inference and Monte Carlo algorithms. (With discussion)
- What do we know about the Metropolis algorithm?
Cited in
(10)- What do we know about the Metropolis algorithm?
- A Repelling–Attracting Metropolis Algorithm for Multimodality
- Issues in the multiple try Metropolis mixing
- On characterizations of Metropolis type algorithms in continuous time
- scientific article; zbMATH DE number 3909610 (Why is no real title available?)
- A multi-point Metropolis scheme with generic weight functions
- Numerical Results for the Metropolis Algorithm
- Convergence rate of multiple-try Metropolis independent sampler
- Metropolis Monte Carlo sampling: convergence, localization transition and optimality
- Cluster Monte Carlo: Extending the range
This page was built for publication: An Extension of the Metropolis Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678836)