Hostname: page-component-745bb68f8f-mzp66 Total loading time: 0 Render date: 2025-01-07T19:24:31.061Z Has data issue: false hasContentIssue false

On the Determination of Redundancies in Sociometric Chains

Published online by Cambridge University Press:  01 January 2025

Ian C. Ross
Affiliation:
University of Michigan
Frank Harary
Affiliation:
University of Michigan

Abstract

The use of a matrix to represent a relationship between the members of a group is well known in sociometry. If this matrix is raised to a certain power, the elements appearing give the total number of connecting paths between each pair of members. In general, some of these paths will be redundant. Methods of finding the number of such redundant paths have been developed for three- and four-step chains by Luce and Perry (3) and Katz (2), respectively. We have derived formulas for the number of redundant paths of five and six steps; and in addition, an algorithm for determining the number of redundant paths of any given length.

Type
Original Paper
Copyright
Copyright © 1952 The 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.)

Footnotes

*

The research leading to this paper was supported by a grant from the Rockefeller Foundation.

References

Festinger, Leon. The analysis of sociograms using matrix algebra. Human Relations, 1949, 2, 153158.CrossRefGoogle Scholar
Katz, Leo. An application of matrix algebra to the study of human relations within organizations. Institute of Statistics, University of North Carolina, Mimeograph Series, 1950.Google Scholar
Luce, R. D., and Perry, A. D.. A method of matrix analysis of group structure. Psychometrika, 1949, 14, 95116.CrossRefGoogle ScholarPubMed
Weiss, Marie J. Higher algebra for the undergraduate. Wiley, 1949, pp. 90144.Google Scholar