On the determination of redundancies in sociometric chains

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.The research leading to this paper was supported by a grant from the Rockefeller Foundation.