Порівняння методів

	Центральність за спрямованою посередністю	Центральність за посередництвом
Галузь	Мережевий аналіз	Мережевий аналіз
Родина	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.