Permutation Models for Relational Data∗

Abstract

We here propose an exponential family of permutation models that is suitable for inferring the direction and strength of association among dyadic relational structures. A linear-time algorithm is shown for MCMC simulation of model draws, as is the use of simulated draws for maximum likelihood estimation (MCMC-MLE) and/or estimation of Monte Carlo standard errors. We also provide an easily performed maximum pseudo-likelihood estimation procedure for the permutation model family, which provides a reasonable means of generating seed models for the MCMC-MLE procedure. Use of the modeling framework is demonstrated via an application involving relationships among managers in a high-tech firm.

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Butts2005PermutationMF, title={Permutation Models for Relational Data∗}, author={Carter T. Butts}, year={2005} }