Methoden vergleichen

	Directed Betweenness Centrality	Betweenness-Zentralität
Fachgebiet	Netzwerkanalyse	Netzwerkanalyse
Familie	Machine learning	Machine learning
Entstehungsjahr	1977	1977
Urheber	Freeman, L. C.	Freeman, L. C.
Typ	Centrality measure (directed graph)	Centrality measure
Wegweisende Quelle	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.
Aliasnamen	directed BC, digraph betweenness, asymmetric betweenness centrality, directed Freeman betweenness	Freeman betweenness, BC, geodesic betweenness, shortest-path betweenness
Verwandt	5	6
Zusammenfassung	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.