On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound
From MaRDI portal
Publication:894567
DOI10.1016/j.spl.2015.06.004zbMath1328.60174OpenAlexW606706924MaRDI QIDQ894567
Publication date: 1 December 2015
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2015.06.004
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
Cites Work
- Unnamed Item
- Geometric bounds for eigenvalues of Markov chains
- Variance bounding Markov chains
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- Information bounds for Gibbs samplers
- On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
- Rates of convergence of the Hastings and Metropolis algorithms
- Accelerating reversible Markov chains
- Bounding the convergence time of the Gibbs sampler in Bayesian image restoration
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
- On the Optimal Transition Matrix for Markov Chain Monte Carlo Sampling
- Equation of State Calculations by Fast Computing Machines
- Monte Carlo sampling methods using Markov chains and their applications