On the Determination of Redundancies in Sociometric Chains
- 1 June 1952
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 17 (2) , 195-208
- https://doi.org/10.1007/bf02288782
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.Keywords
This publication has 2 references indexed in Scilit:
- A method of matrix analysis of group structurePsychometrika, 1949
- The Analysis of Sociograms using Matrix AlgebraHuman Relations, 1949