Pages that link to "Item:Q1877387"
From MaRDI portal
The following pages link to Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). (Q1877387):
Displaying 9 items.
- Gibbs/Metropolis algorithms on a convex polytope (Q455635) (← links)
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements (Q904703) (← links)
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo. (Q1431211) (← links)
- Fast mixing of Metropolis-Hastings with unimodal targets (Q1990039) (← links)
- On the convergence time of some non-reversible Markov chain Monte Carlo methods (Q2218850) (← links)
- Consistent estimation of the spectrum of trace class data augmentation algorithms (Q2325394) (← links)
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on R<sup><i>n</i></sup> (Q3147441) (← links)
- Conductance bounds on the <i>L</i><sup>2</sup> convergence rate of Metropolis algorithms on unbounded state spaces (Q4464174) (← links)
- Numerical Results for the Metropolis Algorithm (Q4828772) (← links)
