Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields

DOI10.1093/biomet/84.1.1zbMath0887.62096OpenAlexW2014441733WikidataQ61719227 ScholiaQ61719227MaRDI QIDQ4364838

Julian Stander, Arnoldo Frigessi, Fabio Martinelli

Publication date: 7 January 1998

Published in: Biometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/biomet/84.1.1

zbMATH Keywords

rate of convergencespectral gapNP-completenessstopping ruleGibbs samplerMetropolis algorithmrange of interaction

Mathematics Subject Classification ID

Random fields; image analysis (62M40) Complexity and performance of numerical algorithms (65Y20) Probabilistic methods, stochastic differential equations (65C99)

Related Items

From Metropolis to diffusions: Gibbs states and optimal scaling., Monte Carlo Markov chains constrained on graphs for a target with disconnected support, On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound, Stochastic adaptive selection of weights in the simulated tempering algorithm, Improved bounds for sampling colorings, Random sampling for the monomer–dimer model on a lattice, An upper bound on the convergence time of the Gibbs sampler in Ising models, Bayesian analysis of the multivariate poisson distribution