Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-25T14:04:56.456Z Has data issue: false hasContentIssue false
  • English
  • Français

Clustering on coloured lattices

Published online by Cambridge University Press:  14 July 2016

David J. Strauss
David J. Strauss*
Affiliation:
University of California, Riverside
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper is concerned with nearest-neighbour systems on the coloured lattice (unordered state space). It extends the paper of Strauss (1975) on clustering in the two-colour case. Comparison is made with the more general methods of Besag (1974). Some tests are developed, and illustrated with an example.

Keywords

NEAREST-NEIGHBOUR SYSTEMMARKOV RANDOM FIELDCLUSTERINGQUALITATIVE DATA
Type
Research Papers
Information
Journal of Applied Probability , Volume 14 , Issue 1 , March 1977 , pp. 135 - 143
Copyright
Copyright © Applied Probability Trust 1977 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bartlett, M. S. (1971) Two-dimensional nearest-neighbour systems and their ecological applications. In Statistical Ecology 1, Pennsylvania State University Press, 179–194.Google Scholar
Besag, J. E. (1974) Spatial interaction and the statistical analysis of lattice systems. J. R. Statist. Soc. B 36, 192–235.Google Scholar
Bloemena, A. R. (1964) Sampling from a graph. Mathematical Centre Tracts No. 2, Amsterdam.Google Scholar
David, F. N. (1971) Measurement of diversity, II. 6th Berkeley Symp. Math. Statist. Prob. 4, 109–136.Google Scholar
Hammersley, J. M. and Clifford, P. (1971) Markov fields on finite graphs and lattices. Unpublished.Google Scholar
Strauss, D. J. (1975) Analysing binary lattice data with the nearest neighbor property. J. Appl. Prob. 12, 702–712.CrossRefGoogle Scholar