Sammenlign metoder

	Positional Analysis	Social netværksanalyse	Triad Census
Fagområde	Sociology	Netværksanalyse	Sociology
Familie	Process / pipeline	Machine learning	Process / pipeline
Oprindelsesår	1976	1934 (sociometry); 1994 (modern formalization)	1970
Ophavsperson	Harrison White, Ronald Burt, and colleagues	Moreno, J.L.; formalized by Wasserman & Faust	Paul Holland & Samuel Leinhardt
Type	Framework for identifying network positions and the roles among them	Structural/relational analysis framework	Enumeration of the 16 isomorphism classes of directed triads
Oprindelig kilde	Burt, R. S. (1976). Positions in networks. Social Forces, 55(1), 93–122.	Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1	Holland, P. W., & Leinhardt, S. (1970). A method for detecting structure in sociometric data. American Journal of Sociology, 76(3), 492–513.
Aliasser	role analysis, positional role analysis, network role and position analysis, regular equivalence analysis	SNA, network analysis, sociometric analysis, relational analysis	triad count, triadic census, 16-type triad census, MAN triad census
Relaterede	5	5	4
Resumé	Positional analysis is the network-analytic program that identifies the positions actors occupy — sets of actors equivalent in their relational patterns — and characterizes the system of roles that links those positions. Growing out of Harrison White's structuralism and Ronald Burt's operationalization in the 1970s, it treats the social structure as a small set of positions and the role relations among them, rather than as a collection of individual actors.	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.	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.