방법 비교

	Triad Census	사회 연결망 분석	Structural Balance Theory
분야	Sociology	네트워크 분석	Sociology
계열	Process / pipeline	Machine learning	Process / pipeline
기원 연도	1970	1934 (sociometry); 1994 (modern formalization)	1946 (Heider); 1956 (Cartwright & Harary)
창시자	Paul Holland & Samuel Leinhardt	Moreno, J.L.; formalized by Wasserman & Faust	Fritz Heider; formalized by Dorwin Cartwright & Frank Harary
유형	Enumeration of the 16 isomorphism classes of directed triads	Structural/relational analysis framework	Theory and graph-theoretic test for tension in signed relationships
원전	Holland, P. W., & Leinhardt, S. (1970). A method for detecting structure in sociometric data. American Journal of Sociology, 76(3), 492–513.	Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1	Cartwright, D., & Harary, F. (1956). Structural balance: a generalization of Heider's theory. Psychological Review, 63(5), 277–293.
별칭	triad count, triadic census, 16-type triad census, MAN triad census	SNA, network analysis, sociometric analysis, relational analysis	balance theory, Heider balance, signed network balance, structural balance analysis
관련	4	5	5
요약	The triad census counts how many of a directed network's three-actor subgroups fall into each of the 16 possible types of triad, providing a compact fingerprint of the network's local structure. Introduced by Paul Holland and Samuel Leinhardt in 1970, it is the standard way to test structural theories — balance, clustering, transitivity, ranked clusters — by comparing the observed distribution of triad types against what a random network would produce.	Social Network Analysis (SNA) is a structural method that maps and measures relationships and flows between people, groups, organizations, or other entities modeled as nodes connected by ties (edges). Rather than focusing on individual attributes, SNA reveals how the pattern of connections shapes behavior, influence, information flow, and outcomes within a system.	Structural balance theory analyzes networks whose ties carry a sign — positive for liking, alliance, or trust, negative for hostility or distrust — and asks which configurations are psychologically and socially stable. Originating in Fritz Heider's cognitive balance principle and given a graph-theoretic form by Dorwin Cartwright and Frank Harary in 1956, it predicts that signed networks evolve toward states free of the tension produced by inconsistent triads such as 'the friend of my enemy'.