A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise

  • Authors:
  • M. Yamamoto;S. Kijima;Y. Matsui

  • Affiliations:
  • Dept. of Mathematical Sciences, School of Science, Tokai University,;Research Institute for Mathematical Sciences, Kyoto University,;Dept. of Mathematical Sciences, School of Science, Tokai University,

  • Venue:
  • COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a polynomial-time perfect sampler for the Q -Ising with a vertex-independent noise. The Q -Ising, one of the generalized models of the Ising, arose in the context of Bayesian image restoration in statistical mechanics. We study the distribution of Q -Ising on a two-dimensional square lattice over n vertices, that is, we deal with a discrete state space {1,...,Q } n for a positive integer Q . Employing the Q -Ising (having a parameter β ) as a prior distribution, and assuming a Gaussian noise (having another parameter *** ), a posterior is obtained from the Bayes' formula. Furthermore, we generalize it: the distribution of noise is not necessarily a Gaussian, but any vertex-independent noise. We first present a Gibbs sampler from our posterior, and also present a perfect sampler by defining a coupling via a monotone update function. Then, we show O (n logn ) mixing time of the Gibbs sampler for the generalized model under a condition that β is sufficiently small (whatever the distribution of noise is). In case of a Gaussian, we obtain another more natural condition for rapid mixing that *** is sufficiently larger than β . Thereby, we show that the expected running time of our sampler is O (n logn ).