Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T08:02:22.526Z Has data issue: false hasContentIssue false

Conformity of Two Sociometric Relations

Published online by Cambridge University Press:  01 January 2025

Stanley Wasserman*
Affiliation:
Departments of Psychology and Statistics, University of Illinois at Urbana-Champaign
*
Requests for reprints should be made to Stanley Wasserman, Department of Psychology, University of Illinois, 603 East Daniel Street, Champaign, IL 61820.

Abstract

The problem of comparing two sociometric relations or measurements (A and B) recorded in distinct sociomatrices was originally discussed by Katz and Powell in the early 1950's and Hubert and Baker in the late 1970's. The problem is considered again using a probabilistic model designed specifically for discrete-valued network measurements. The model allows for the presence of various structural tendencies, such as reciprocity and differential popularity. A parameter that isolates the tendency for actors to choose other actors on both relations simultaneously is introduced, and estimated conditional on the presence of other parameters that reflect additional important network properties. The parameter is presented as a symmetric index but is also generalized to the predictive (A on B or B on A) situation. This approach to the problem is illustrated with the same data used by the earlier solutions, and the unique nature of the two relations in the data set (A = received choices, B = perceived choices), as it affects the modeling, is discussed. Significance tests for the parameter and related parameters are described, as well as an extension to more than two relations.

Information

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

Article purchase

Temporarily unavailable