论文信息 - Clique structure in school class data

Clique structure in school class data

Abstract A probability model for friendship networks is introduced that is based on a random choice structure and an unknown underlying clique structure. Two different approaches for estimating the clique structure are discussed, the maximum likelihood approach and the Bayesian approach. The model is applied to data consisting of a number of friendship networks, obtained from a large study of school classes in sixth grade.

Ingegerd Jansson | Ingegerd Jansson

[1] Ove Frank,et al. Estimation of the Number of Connected Components in a Graph by Using a Sampled Subgraph , 1978 .

[2] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994 .

[3] Kenneth A. Frank,et al. Identifying cohesive subgroups , 1995 .

[4] M. Hallinan. The process of friendship formation , 1978 .

[5] Charles H. Hubbell. An Input-Output Approach to Clique Identification , 1965 .

[6] Martin Karlberg,et al. Testing transitivity in graphs , 1997 .

[7] Philip M. Lankford. Comparative Analysis of Clique Identification Methods , 1974 .

[8] M. Aldenderfer,et al. Cluster Analysis. Sage University Paper Series On Quantitative Applications in the Social Sciences 07-044 , 1984 .

[9] M. V. Valkenburg. Network Analysis , 1964 .

[10] George C. Runger,et al. Longitudinal analysis of friendship networks , 1979 .

[11] Ove Frank,et al. MOMENT PROPERTIES OF SUBGRAPH COUNTS IN STOCHASTIC GRAPHS , 1979 .

[12] Maureen T. Hallinan,et al. Structural Effects on Children's Friendships and Cliques. , 1979 .

[13] Frank Harary,et al. A Procedure for Clique Detection Using the Group Matrix , 1957 .