Random Directed Graph Distributions in the Triad Census in Social Networks
NBER Working Paper No. 113
This paper uses the concept of the triad census first introduced by Holland and Leinhardt, and describes several distributions on directed graphs. Methods are presented for calculating the mean and the covariance matrix of the triad census for the uniform distribution that conditions on the number of choices made by each individual in the social network. Several complex distributions on digraphs are approximated, and an application of these methods to a sociogram is given.
Document Object Identifier (DOI): 10.3386/w0113
Published: Stanley S. Wasserman, 1977. "Random directed graph distributions and the triad census in social networks†," The Journal of Mathematical Sociology, vol 5(1), pages 61-86.
Users who downloaded this paper also downloaded these: