Matrix methods for calculating the triad census

被引:35
作者
Moody, J [1 ]
机构
[1] Univ N Carolina, Dept Sociol, Chapel Hill, NC 27599 USA
基金
美国国家卫生研究院; 美国国家科学基金会;
关键词
D O I
10.1016/S0378-8733(98)00006-9
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
The triad census, T, of a directed network summarizes much of the structural information in a network. Thus, it has been very useful in analyzing structural properties within social networks. This paper presents a set of simple matrix formulas for calculating T. Previous work with the triad census has required enumerating each triad in the graph, which can be time consuming for very large networks. The formulas presented in this paper increase the efficiency of calculating T by an order of magnitude. Thus, these formulas provide researchers with very large networks, or the need to calculate T many times, an efficient tool for studying underlying structural patterns. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:291 / 299
页数:9
相关论文
共 14 条
[1]  
[Anonymous], SOCIOLOGICAL METHODO
[2]  
BURT RS, 1984, STRUCTURAL HOLES SOC
[3]   STRUCTURAL BALANCE - A GENERALIZATION OF HEIDER THEORY [J].
CARTWRIGHT, D ;
HARARY, F .
PSYCHOLOGICAL REVIEW, 1956, 63 (05) :277-293
[4]  
Davis J A., 1972, Sociological Theories in Progress, V54, P218
[5]   TRANSITIVITY AND THE PATH CENSUS IN SOCIOMETRY [J].
FERSHTMAN, M .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 1985, 11 (02) :159-189
[6]   TRANSITIVITY IN STRUCTURAL MODELS OF SMALL GROUPS [J].
HOLLAND, PW ;
LEINHARDT, S .
COMPARATIVE GROUP STUDIES, 1971, 2 (02) :107-124
[7]  
HOLLAND PW, 1970, AM J SOCIOL, V70, P492
[8]   STRUCTURE AND PROCESS - AGREEMENT MODELS FOR FRIENDSHIP FORMATION [J].
JOHNSEN, EC .
SOCIAL NETWORKS, 1986, 8 (03) :257-306
[9]   NETWORK MACROSTRUCTURE MODELS FOR THE DAVIS-LEINHARDT SET OF EMPIRICAL SOCIOMATRICES [J].
JOHNSEN, EC .
SOCIAL NETWORKS, 1985, 7 (03) :203-224
[10]   EXTENSIONS OF TRIAD COUNTS TO NETWORKS WITH DIFFERENT SUBSETS OF POINTS AND TESTING UNDERLYING RANDOM GRAPH DISTRIBUTIONS [J].
SNIJDERS, TAB ;
STOKMAN, FN .
SOCIAL NETWORKS, 1987, 9 (03) :249-275