Estimation and prediction for stochastic blockstructures

Journal of the American Statistical Association

Volumn 96, Issue 455, 2001, Pages 1077-1087

  Nowicki, Krzysztof ^a   Snijders, Tom A B ^b  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Cluster analysis; Colored graph; Gibbs sampling; Latent class model; Mixture model; Social network

Indexed keywords

EID: 0442296603     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1198/016214501753208735     Document Type: Article

References (30)

1. Anderson, C. J., Wasserman, S., and Faust, K. (1992), “Building Stochastic Blockmodels,” Social Networks, 14, 137–161.
2. Beum, C. O., and Brundage, E. G. (1950), “A Method for Analysing the Sociomatrix,” Sociometry, 12, 141–145.
3. Bock, H. H. (1996a), “Probabilistic Models in Cluster Analysis,” Computational Statistics and Data Analysis, 23, 5–28.
4. Bock, H. H. (1996b), “Probability Models and Hypotheses Testing in Partitioning Cluster Analysis,” in Clustering and Classification, eds. P. Arabie, L. J. Hubert, and G. de Soete, River Edge, NJ: World Scientific Publishing, pp. 377–453.
5. Borgatti, S., Everett, M. G., and Freeman, L. C. (1998), UCINET V Reference Manual, Columbia, SC: Analytic Technologies.
6. Faust, K. (1988), “Comparison of Methods for Positional Analysis: Structural and General Equivalences,” Social Networks, 10, 313–341.
7. Fienberg, S. E., and Wasserman, S. (1981), “Categorical Data Analysis of Single Sociometric Relations,” in Sociological Methodology–1981, ed. S. Leinhardt San Francisco: Jossey-Bass, pp. 156–192.
8. Frank, O. (1988a), “Triad Count Statistics,” Discrete Mathematics, 72, 141–149.
9. Frank, O. (1988b), “Random Sampling and Social Networks: A Survey of Various Approaches,” Mathématiques, Informatique et Sciences Humaines, 26(104), 19–33.
10. Frank, O., and Harary, F. (1982), “Cluster Inference by Using Transitivity Indices in Empirical Graphs,” Journal of the American Statistical Association, 81, 835–840.
11. Gelman, A. (1996), “Inference and Monitoring Convergence,” in Markov Chain Monte Carlo in Practice, eds. W. Gilks, S. Richardson, and D. Spiegelhalter, London: Chapman and Hall, pp. 131–144.
12. Gelman, A., Carlin, J. B., Stern, H., and Rubin, D. B. (1995), Bayesian Data Analysis, London: Chapman and Hall.
13. Gelman, A., and Rubin, D. B. (1992), “Inference From Iterative Simulation Using Multiple Sequences” (with discussion), Statistical Science, 7, 457–511.
14. Gilks, W. R., Richardson, S., and Spiegelhalter, D. J. (1996), Markov Chain Monte Carlo in Practice, London: Chapman and Hall.
15. Gilks, W. R., and Roberts, G. O. (1996), “Strategies for Improving MCMC,” in Markov Chain Monte Carlo in Practice, eds. W. Gilks, S. Richardson, and D. Spiegelhalter, London: Chapman and Hall, pp. 89–114.
16. Holland, P., Laskey, K. B., and Leinhardt, S. (1983), “Stochastic Blockmodels: Some First Steps,” Social Networks, 5, 109–137.
17. Holland, P., and Leinhardt, S. (1981), “An Exponential Family of Probability Distributions for Directed Graphs,” Journal of the American Statistical Association, 76, 33–50.
18. Janson, S., and Nowicki, K. (1991), “The Asymptotic Distributions of Generalized U-Statistics With Applications to Random Graphs,” Probability Theory and Related Fields, 90, 341–375.
19. Kapferer, B. (1972), Strategy and Transaction in an African Factory, Manchester, U.K.: Manchester University Press.
20. Lerman, I. C. (1988), “Comparing Partitions (Mathematical and Statistical Aspects),” in Classification and Related Methods of Data Analysis, ed. H. H. Block, Amsterdam: Elsevier/North-Holland, pp. 121–131.
21. Lorrain, F., and White, H. C. (1971), “Structural Equivalence of Individuals in Social Networks,” Journal of Mathematical Sociology, 1, 49–80.
22. Rand, W. M. (1971), “Objective Criteria for the Comparison of Clustering Methods,” Journal of the American Statistical Association, 66, 846–850.
23. Robert, C. P. (1996), “Mixtures of Distributions: Inference and Estimation,” in Markov Chain Monte Carlo in Practice, eds. W. Gilks, S. Richardson, and D. Spiegelhalter, London: Chapman and Hall, pp. 441–464.
24. Sibuya, M. (1993), “Random Partition of a Finite Set by Cycles of Permutation,” Japan Journal of Industrial and Applied Mathematics, 10, 69–84.
25. Snijders, T., and Nowicki, K. (1997), “Estimation and Prediction for Stochastic Blockmodels for Graphs With Latent Block Structure,” Journal of Classificcation, 14, 75–100.
26. Wasserman, S., and Anderson, C. (1987), “Stochastic a Posteriori Blockmodels: Construction and Assessment,” Social Networks, 9, 1–36.
27. Wasserman, S., and Faust, K. (1994), Social Network Analysis: Methods and Applications, Cambridge, U.K.: Cambridge University Press.
28. Wasserman, S., and Pattison, P. (1996), “Logit Models and Logistic Regression for Social Networks: I. An Introduction to Markov Graphs and p,” Psychometrika, 61, 401–425.
29. Wellman, B., Frank, O., Espinoza, V., Lundquist, S., and Wilson, C. (1991), “Integrating Individual, Relational and Structural Analysis,” Social Networks, 13, 223–249.
30. White, H. C., Boorman, S., and Breiger, R. L. (1976), “Social Structure From Multiple Networks,” American Journal of Sociology, 81, 730–780.