What Do We Know about the Metropolis Algorithm ?
Open Access
- 31 August 1998
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 57 (1), 20-36
- https://doi.org/10.1006/jcss.1998.1576
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Logarithmic Sobolev inequalities for finite Markov chainsThe Annals of Applied Probability, 1996
- Nash inequalities for finite Markov chainsJournal of Theoretical Probability, 1996
- Eigenvalues of Graphs and Sobolev InequalitiesCombinatorics, Probability and Computing, 1995
- $L^2$ Convergence of Time Nonhomogeneous Markov Processes: I. Spectral EstimatesThe Annals of Applied Probability, 1994
- Sampling from Log-Concave DistributionsThe Annals of Applied Probability, 1994
- Comparison Theorems for Reversible Markov ChainsThe Annals of Applied Probability, 1993
- Eigen-analysis for some examples of the Metropolis algorithmContemporary Mathematics, 1992
- Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion ProcessThe Annals of Applied Probability, 1991
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991