Exponential-Family Random Graph Models for Rank-Order Relational Data

Abstract

Rank-order relational data, in which each actor ranks the others according to some criterion, often arise from sociometric measurements of judgment (e.g., self-reported interpersonal interaction) or preference (e.g., relative liking). We propose a class of exponential-family models for rank-order relational data and derive a new class of sufficient statistics for such data, which assume no more than within-subject ordinal properties. Application of MCMC MLE to this family allows us to estimate effects for a variety of plausible mechanisms governing rank structure in cross-sectional context, and to model the evolution of such structures over time. We apply this framework to model the evolution of relative liking judgments in an acquaintance process, and to model recall of relative volume of interpersonal interaction among members of a technology education program.

50 pages, 6 figures, 4 tables, 1 algorithm. The paper has been expanded and clarified, and some terms were changed

References in corpus (4)

• A Separable Model for Dynamic Networks
• Modeling social networks from sampled data
• Exponential-Family Random Graph Models for Valued Networks
• Valued Ties Tell Fewer Lies: Why Not To Dichotomize Network Edges With Thresholds

Cited by in corpus (9)

• Exponential-Family Models of Random Graphs: Inference in Finite-, Super-, and Infinite Population Scenarios
• Latent Space Models for Dynamic Networks with Weighted Edges
• ergm 4: New features
• Latent Space Approaches to Community Detection in Dynamic Networks
• What is the Entropy of a Social Organization?
• A Dynamic Process Interpretation of the Sparse ERGM Reference Model
• Parameter Estimation Procedures for Exponential-Family Random Graph Models on Count-Valued Networks: A Comparative Simulation Study
• Selection of Exponential-Family Random Graph Models via Held-Out Predictive Evaluation (HOPE)
• Likelihoods for fixed rank nomination networks