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


  • Journal: Biometrika, vol. 84, p. 18012012–99999, Wednesday 1. January 1997
  • Utgiver: Oxford University Press
  • Internasjonale standardnumre:
    • Trykt: 0006-3444
    • Elektronisk: 1464-3510
  • Lenke:

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 γ<1, which is still more favourable than enumerating all the states. When the interaction range grows with n, the algorithms can converge exponentially in n. Analogous results are provided for an expectation approximated by an average along the chain.