手法を比較

	指向性ソーシャルネットワーク分析	Betweenness Centrality
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	1994	1977
提唱者	Wasserman, S. & Faust, K.	Freeman, L. C.
種類	Structural analysis of directed graphs	Centrality measure
原典	Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
別名	directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis	Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness
関連	5	6
概要	Directed Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades.	Betweenness centrality, formalized by Linton C. Freeman in 1977, measures how often a node lies on the shortest path connecting every other pair of nodes in a network. High-betweenness nodes act as bridges or brokers: removing them fragments the network into disconnected components more severely than removing any other nodes.