What do we know about the Metropolis algorithm?
From MaRDI portal
Publication:1273859
DOI10.1006/jcss.1998.1576zbMath0920.68054OpenAlexW2019473674MaRDI QIDQ1273859
Persi Diaconis, Laurent Saloff-Coste
Publication date: 6 January 1999
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1998.1576
Related Items
Analysis of a nonreversible Markov chain sampler., Antiduality and Möbius monotonicity: generalized coupon collector problem, Forward Chaining for Hybrid ASP, \(L^p\) estimates for Feynman-Kac propagators with time-dependent reference measures, Simulated tempering and swapping on mean-field models, Non-reversible Metropolis-Hastings, Numerical Results for the Metropolis Algorithm, Optimal scaling of a gradient method for distributed resource allocation, A thermodynamic formalism for continuous time Markov chains with values on the Bernoulli space: entropy, pressure and large deviations, Geometric ergodicity and the spectral gap of non-reversible Markov chains, Spectral gaps and error estimates for infinite-dimensional Metropolis-Hastings with non-Gaussian priors, Latent uniform samplers on multivariate binary spaces, Safe Metropolis-Hastings algorithm and its application to swarm control, Convergence rate of multiple-try Metropolis independent sampler, On the stability of positive semigroups, Spectral computations for birth and death chains, Gibbs/Metropolis algorithms on a convex polytope, A geometric interpretation of the Metropolis-Hastings algorithm., A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines, Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities, Explicit criteria on separation cutoff for birth and death chains, Stein's method, Jack measure, and the Metropolis algorithm, Mixing times of the biased card shuffling and the asymmetric exclusion process, Semi-classical analysis of a random walk on a manifold, Stability results for Harnack inequalities., An Extension of the Metropolis Algorithm, Mixing time of an unaligned Gibbs sampler on the square, Separation cut-offs for birth and death chains, On quantitative convergence to quasi-stationarity, The swapping algorithm for the Hopfield model with two patterns, The Markov chain Monte Carlo revolution, Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity, Vertex nomination: the canonical sampling and the extended spectral nomination schemes, Micro-local analysis for the Metropolis algorithm, Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces, A discipline of evolutionary programming, Logarithmic Sobolev inequalities for finite Markov chains, On swapping and simulated tempering algorithms., SPECTRAL ANALYSIS OF HYPOELLIPTIC RANDOM WALKS, Double coset Markov chains, Distance-reducing Markov bases for sampling from a discrete sample space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nash inequalities for finite 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
- Metric methods for analyzing partially ranked data
- Approximate counting, uniform generation and rapidly mixing Markov chains
- The logarithmic Sobolev inequality for discrete spin systems on a lattice
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Comparison theorems for reversible Markov chains
- Slow droplet-driven relaxation of stochastic Ising models in the vicinity of the phase coexistence region
- On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
- Sampling from log-concave distributions
- Hypergroup deformations and Markov chains
- For 2-D lattice spin systems weak mixing implies strong mixing
- Computable bounds for geometric convergence rates of Markov chains
- \(L^ 2\) convergence of time nonhomogeneous Markov processes. I: Spectral estimates
- Bound on the mass gap for finite volume stochastic Ising models at low temperature
- On the two-dimensional dynamical Ising model in the phase coexistence region
- Rates of convergence of the Hastings and Metropolis algorithms
- Logarithmic Sobolev inequalities for finite Markov chains
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Optimum Monte-Carlo sampling using Markov chains
- Large Cliques Elude the Metropolis Process
- Random walks in a convex body and an improved volume algorithm
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Adaptive Rejection Metropolis Sampling within Gibbs Sampling
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Eigenvalues of Graphs and Sobolev Inequalities
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
