Pages that link to "Item:Q1333379"
From MaRDI portal
The following pages link to On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds (Q1333379):
Displaying 16 items.
- Constructing optimal transition matrix for Markov chain Monte Carlo (Q890561) (← links)
- On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound (Q894567) (← links)
- What do we know about the Metropolis algorithm? (Q1273859) (← links)
- Information bounds for Gibbs samplers (Q1307091) (← links)
- Outperforming the Gibbs sampler empirical estimator for nearest-neighbor random fields (Q1354360) (← links)
- Coupling, spectral gap and related topics. II (Q1375818) (← links)
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo. (Q1431211) (← links)
- Reversible algorithm of simulating multivariate densities with multi-hump (Q1609649) (← links)
- The smallest eigenvalue for reversible Markov chains (Q1826846) (← links)
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). (Q1877387) (← links)
- Markov chain convergence: From finite to infinite (Q1915845) (← links)
- The convergence rate of the Gibbs sampler for generalized 1-D Ising model (Q2273720) (← links)
- A gentle stochastic thermostat for molecular dynamics (Q2391046) (← links)
- Markov-chain monte carlo: Some practical implications of theoretical results (Q4399495) (← links)
- Improved bounds for the large-time behaviour of simulated annealing (Q4819508) (← links)
- Sensitivity and convergence of uniformly ergodic Markov chains (Q5476144) (← links)
