Hostname: page-component-745bb68f8f-cphqk Total loading time: 0 Render date: 2025-01-08T09:48:54.925Z Has data issue: false hasContentIssue false
  • English
  • Français

Connectivity and Generalized Cliques in Sociometric Group Structure

Published online by Cambridge University Press:  01 January 2025

R. Duncan Luce
R. Duncan Luce*
Affiliation:
Graduate Student, Department of Mathematics, Massachusetts Institute of Technology
Get access Rights & Permissions [Opens in a new window]

Abstract

By using the concepts of antimetry and n-chain it is possible to define and to investigate some properties of connectivity in a sociometric group. It is shown that the number of elements in a group, the number of antimetries, and the degree of connectivity must satisfy certain inequalities. Using the ideas of connectivity, a generalized concept of clique, called an n-clique, is introduced. n-cliques are shown to have a very close relationship to the existence of cliques in an artificial structure defined on the same set of elements, thus permitting the determination of n-cliques by means of the same simple matrix procedures used to obtain the clique structures. The presence of two or more m-cliques, where m is the number of elements in the group, is proved to mean an almost complete splitting of the group.

Type
Original Paper
Information
Psychometrika , Volume 15 , Issue 2 , June 1950 , pp. 169 - 190
Copyright
Copyright © 1950 Psychometric Society

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

Birkhoff, G. Lattice theory, New York: American Mathematical Society, 1948.Google Scholar
Wedderburn, J. H. M. Boolean matrices. Annals of Math., 1934, 35, 185–194.CrossRefGoogle Scholar
Luce, R. Dunca, and Perry, Albert D. A method of matrix analysis of group structure. Psychometrika, 1949, 14, 95–116.CrossRefGoogle ScholarPubMed