手法を比較

	有向介数中心性	Betweenness Centrality
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	1977	1977
提唱者	Freeman, L. C.	Freeman, L. C.
種類	Centrality measure (directed graph)	Centrality measure
原典	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.	Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41.
別名	directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness	Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness
関連	5	6
概要	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.	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.