For an autologistic binary-image model on a finite undirected graph, let and give the configuration prior mass proportional toSuppose are independent Gaussian distribution observations with expected value and unit variance. Their local log-likelihood ratio for versus isWriting , the full posterior conditional probability is thereforeThus the local evidence changes the one-site field while retaining the same neighbor interaction. For a noise variance , replace by .
The graphical conditional independence survives this update: vertices in any independent color class are conditionally independent given the other vertices and the observations. On a nearest-neighbor square grid, the two checkerboard colors give such classes, so one color can be updated in parallel in a Gibbs sampler. An arbitrary graph need not be bipartite and may require more colors. Updating every vertex simultaneously from its old neighbors is not the same as this exact conditional block update.
Articles by others on the same topic
There are currently no matching articles.