手法を比較

	有向介数中心性	指向性固有ベクトル中心性
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	1977	1972–1987
提唱者	Freeman, L. C.	Bonacich, P.
種類	Centrality measure (directed graph)	Centrality measure (eigenvector-based, directed)
原典	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.	Bonacich, P. (1987). Power and centrality: A family of measures. American Journal of Sociology, 92(5), 1170–1182.
別名	directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness	directed EC, asymmetric eigenvector centrality, right eigenvector centrality, left eigenvector centrality
関連	5	5
概要	Directed Betweenness Centrality extends Freeman's classic betweenness measure to directed graphs, quantifying how often a node lies on the shortest directed paths between all other pairs of nodes. It identifies gatekeepers, brokers, and bottlenecks in asymmetric flows such as information cascades, citation networks, and organizational hierarchies.	Directed eigenvector centrality extends the classic eigenvector centrality to directed graphs by scoring each node according to the centrality of the nodes that point to it (in-direction) or that it points to (out-direction). A node earns a high score not merely by having many connections but by being connected to other highly central nodes, capturing asymmetric influence in citation networks, social hierarchies, and information flows.