What do we know about the Metropolis algorithm?
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1263187
- Simple Monte Carlo and the Metropolis algorithm
- An Extension of the Metropolis Algorithm
- scientific article; zbMATH DE number 953296
- An algorithm derived from the Metropolis algorithm
- Metropolis-Hastings algorithms with acceptance ratios of nearly 1
- A quasi-Monte Carlo Metropolis algorithm
Cites work
- L^ 2 convergence of time nonhomogeneous Markov processes. I: Spectral estimates
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Adaptive Rejection Metropolis Sampling within Gibbs Sampling
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Bound on the mass gap for finite volume stochastic Ising models at low temperature
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Comparison theorems for reversible Markov chains
- Computable bounds for geometric convergence rates of Markov chains
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Eigenvalues of Graphs and Sobolev Inequalities
- Equation of state calculations by fast computing machines
- For 2-D lattice spin systems weak mixing implies strong mixing
- Geometric bounds for eigenvalues of Markov chains
- scientific article; zbMATH DE number 420886 (Why is no real title available?)
- scientific article; zbMATH DE number 431548 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 472933 (Why is no real title available?)
- scientific article; zbMATH DE number 479937 (Why is no real title available?)
- scientific article; zbMATH DE number 522891 (Why is no real title available?)
- scientific article; zbMATH DE number 797404 (Why is no real title available?)
- scientific article; zbMATH DE number 5050923 (Why is no real title available?)
- Hypergroup deformations and Markov chains
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Large Cliques Elude the Metropolis Process
- Logarithmic Sobolev inequalities for finite Markov chains
- Metric methods for analyzing partially ranked data
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Monte Carlo sampling methods using Markov chains and their applications
- Nash inequalities for finite Markov chains
- On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
- On the two-dimensional dynamical Ising model in the phase coexistence region
- Optimum Monte-Carlo sampling using Markov chains
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Random walks in a convex body and an improved volume algorithm
- Rates of convergence of the Hastings and Metropolis algorithms
- Sampling from log-concave distributions
- Slow droplet-driven relaxation of stochastic Ising models in the vicinity of the phase coexistence region
- The logarithmic Sobolev inequality for discrete spin systems on a lattice
Cited in
(58)- Micro-local analysis for the Metropolis algorithm
- A geometric interpretation of the Metropolis-Hastings algorithm.
- A discipline of evolutionary programming
- An algorithm derived from the Metropolis algorithm
- Safe Metropolis-Hastings algorithm and its application to swarm control
- Stability results for Harnack inequalities.
- About relaxation time of finite generalized Metropolis algorithms
- Analysis of a nonreversible Markov chain sampler.
- Geometric ergodicity and the spectral gap of non-reversible Markov chains
- Explicit criteria on separation cutoff for birth and death chains
- Semi-classical analysis of a random walk on a manifold
- Mixing time of an unaligned Gibbs sampler on the square
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
- Spectral computations for birth and death chains
- Logarithmic Sobolev inequalities for finite Markov chains
- On swapping and simulated tempering algorithms.
- scientific article; zbMATH DE number 431548 (Why is no real title available?)
- Simulated tempering and swapping on mean-field models
- On characterizations of Metropolis type algorithms in continuous time
- Non-reversible Metropolis-Hastings
- Forward chaining for hybrid ASP
- The Markov chain Monte Carlo revolution
- scientific article; zbMATH DE number 3909610 (Why is no real title available?)
- A thermodynamic formalism for continuous time Markov chains with values on the Bernoulli space: entropy, pressure and large deviations
- scientific article; zbMATH DE number 1263187 (Why is no real title available?)
- Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces
- Gibbs/Metropolis algorithms on a convex polytope
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- An Extension of the Metropolis Algorithm
- Numerical Results for the Metropolis Algorithm
- A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines
- Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity
- Understanding the Hastings algorithm
- Spectral analysis of hypoelliptic random walks
- Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities
- Double coset Markov chains
- Antiduality and Möbius monotonicity: generalized coupon collector problem
- On quantitative convergence to quasi-stationarity
- Spectral gaps and error estimates for infinite-dimensional Metropolis-Hastings with non-Gaussian priors
- Latent uniform samplers on multivariate binary spaces
- Multidimensional examples of the Metropolis algorithm
- Convergence rate of multiple-try Metropolis independent sampler
- On the stability of positive semigroups
- Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles
- Mixing reversible Markov chains in the max-\(\ell^2\)-distance
- Sampling from a neural network
- Convergence rates of Metropolis-Hastings algorithms
- Uniform sampling of fixed size polyominoes
- Sampling from p-adic algebraic manifolds
- Spatial permutations sampling convergence speed
- Stein's method, Jack measure, and the Metropolis algorithm
- The swapping algorithm for the Hopfield model with two patterns
- Performance of the Metropolis algorithm on a disordered tree: the Einstein relation
- Distance-reducing Markov bases for sampling from a discrete sample space
- \(L^p\) estimates for Feynman-Kac propagators with time-dependent reference measures
- Optimal scaling of a gradient method for distributed resource allocation
- Convergence of Metropolis-type algorithms for a large canonical ensemble
- Separation cut-offs for birth and death chains
This page was built for publication: What do we know about the Metropolis algorithm?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273859)
