Extensions of triad counts to networks with different subsets of points and testing underlying random graph distributions
- 1 September 1987
- journal article
- Published by Elsevier in Social Networks
- Vol. 9 (3) , 249-275
- https://doi.org/10.1016/0378-8733(87)90022-0
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Stochastic Blockmodels for Directed GraphsJournal of the American Statistical Association, 1987
- Transitivity and the path census in sociometryThe Journal of Mathematical Sociology, 1985
- An Exponential Family of Probability Distributions for Directed GraphsJournal of the American Statistical Association, 1981
- The degree variance: An index of graph heterogeneitySocial Networks, 1981
- Random directed graph distributions and the triad census in social networks†The Journal of Mathematical Sociology, 1977
- An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scalingJournal of Mathematical Psychology, 1975
- A Method for Detecting Structure in Sociometric DataAmerican Journal of Sociology, 1970
- The Variance of the Number of Mutual Choices in sociometryPsychometrika, 1956