Skip to main content

Efficient calculation of the normalizing constant of the autologistic and related models on the cylinder and lattice

Buy Article:

$51.00 plus tax (Refund Policy)

Abstract:

Summary.

Motivated by the autologistic model for the analysis of spatial binary data on the two-dimensional lattice, we develop efficient computational methods for calculating the normalizing constant for models for discrete data defined on the cylinder and lattice. Because the normalizing constant is generally unknown analytically, statisticians have developed various ad hoc methods to overcome this difficulty. Our aim is to provide computationally and statistically efficient methods for calculating the normalizing constant so that efficient likelihood-based statistical methods are then available for inference. We extend the so-called transition method to find a feasible computational method of obtaining the normalizing constant for the cylinder boundary condition. To extend the result to the free-boundary condition on the lattice we use an efficient path sampling Markov chain Monte Carlo scheme. The methods are generally applicable to association patterns other than spatial, such as clustered binary data, and to variables taking three or more values described by, for example, Potts models.

Keywords: Autologistic distribution; Gibbs distribution; Ising model; Markov chain Monte Carlo sampling; Path sampling; Potts model; Transition method

Document Type: Research Article

DOI: http://dx.doi.org/10.1111/1467-9868.00383

Affiliations: 1: Queensland University of Technology, Brisbane, Australia 2: University of Glasgow, UK

Publication date: February 1, 2003

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Partial Open Access Content
Partial Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more