Micro-local analysis for the Metropolis algorithm

DOI10.1007/S00209-008-0383-9MaRDI QIDQ1024207zbMATH OpenOpenAlexFDO

Authors Persi Diaconis, Gilles Lebeau

Publication date 16 June 2009

Published in Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00209-008-0383-9

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Metropolis
• Geometric analysis for the Metropolis algorithm on Lipschitz domains
• What do we know about the Metropolis algorithm?
• scientific article; zbMATH DE number 431548
• Spectral asymptotics for the Metropolis algorithm on singular domains

Cites work

• scientific article; zbMATH DE number 3969124 (Why is no real title available?)
• scientific article; zbMATH DE number 1339094 (Why is no real title available?)
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• scientific article; zbMATH DE number 1500599 (Why is no real title available?)
• A geometric interpretation of the Metropolis-Hastings algorithm.
• Algorithms and Computation
• An introduction to semiclassical and microlocal analysis
• Boundary problems for pseudo-differential operators
• Conductance bounds on the L² convergence rate of Metropolis algorithms on unbounded state spaces
• Exact Analytical Solutions of the Transcendental Equation $\alpha \sin \zeta = \zeta $
• Geometric ergodicity of Metropolis algorithms
• Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains
• Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
• Markov chains and stochastic stability
• Monte Carlo sampling methods using Markov chains and their applications
• Monte Carlo simulation in statistical physics. An introduction.
• Monte Carlo strategies in scientific computing
• Numerical Results for the Metropolis Algorithm
• Optimum Monte-Carlo sampling using Markov chains
• Rates of convergence of the Hastings and Metropolis algorithms
• Semi-classical analysis of a random walk on a manifold
• What do we know about the Metropolis algorithm?

Cited in

(14)

• Singular relaxation of a random walk in a box with a Metropolis Monte Carlo dynamics
• Metropolis Monte Carlo sampling: convergence, localization transition and optimality
• Sparse locally-jammed disk packings
• Spectral gaps and error estimates for infinite-dimensional Metropolis-Hastings with non-Gaussian priors
• Spectral asymptotics for the Metropolis algorithm on singular domains
• Metropolis
• Geometric analysis for the Metropolis algorithm on Lipschitz domains
• scientific article; zbMATH DE number 431548 (Why is no real title available?)
• Another conversation with Persi Diaconis
• Semi-classical analysis of a random walk on a manifold
• Gibbs/Metropolis algorithms on a convex polytope
• The mathematics of mixing things up
• Random walk on surfaces with hyperbolic cusps
• The Markov chain Monte Carlo revolution

This page was built for publication: Micro-local analysis for the Metropolis algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024207)