Fast mixing of Metropolis-Hastings with unimodal targets
From MaRDI portal
Publication:1990039
DOI10.1214/18-ECP170zbMath1414.60054arXiv1806.07047OpenAlexW2963110896MaRDI QIDQ1990039
Publication date: 24 October 2018
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07047
Computational methods in Markov chains (60J22) Discrete-time Markov processes on general state spaces (60J05)
Related Items
Spectral gaps and error estimates for infinite-dimensional Metropolis-Hastings with non-Gaussian priors, Vertex nomination: the canonical sampling and the extended spectral nomination schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Nash inequalities for finite Markov chains
- Markov chains and stochastic stability
- Gibbs sampling, exponential families and orthogonal polynomials
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Comparison theorems for reversible Markov chains
- Geometric ergodicity and hybrid Markov chains
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
- Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
- Geometric ergodicity of Metropolis algorithms
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Rates of convergence of the Hastings and Metropolis algorithms
- Logarithmic Sobolev inequalities for finite Markov chains
- Yet Another Look at Harris’ Ergodic Theorem for Markov Chains
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications
