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

Publisher Website
Google Scholar
Abstract
This paper studies the computational complexity of Markov chain Monte Carlo algorithms with finite-valued Markov random fields on a finite regular lattice as target distributions. We state conditions under which the complexity for approximate convergence is polynomial in n, the number of variables. Approximate convergence takes time O(n log n) as n→∞ if the target field satisfies certain spatial mixing conditions. Otherwise, if the field has a potential with finite interaction range independent of n, the complexity is exponential in nγ, with γn, the algorithms can converge exponentially in n. Analogous results are provided for an expectation approximated by an average along the chain.

This publication has 0 references indexed in Scilit: