On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound
DOI10.1016/J.SPL.2015.06.004zbMATH Open1328.60174OpenAlexW606706924MaRDI QIDQ894567FDOQ894567
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) Numerical analysis or methods applied to Markov chains (65C40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Cites Work
- Title not available (Why is that?)
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Monte Carlo sampling methods using Markov chains and their applications
- Equation of State Calculations by Fast Computing Machines
- Rates of convergence of the Hastings and Metropolis algorithms
- Geometric bounds for eigenvalues of Markov chains
- Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields
- Accelerating reversible Markov chains
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Variance bounding Markov chains
- On the Optimal Transition Matrix for Markov Chain Monte Carlo Sampling
- Bounding the convergence time of the Gibbs sampler in Bayesian image restoration
- Information bounds for Gibbs samplers
- On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds
- Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
Cited In (2)
This page was built for publication: On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894567)
