Directed Betweenness Centrality
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.
Читать метод полностью
Войдите с бесплатным аккаунтом, чтобы прочитать этот раздел.
Method map
The neighbourhood of related methods — select a node to explore.
Источники
- Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI: 10.2307/3033543 ↗
- Brandes, U. (2001). A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), 163–177. DOI: 10.1080/0022250X.2001.9990249 ↗
Как цитировать эту страницу
ScholarGate. (2026, June 3). Directed Betweenness Centrality (Freeman's Betweenness on Directed Graphs). ScholarGate. https://scholargate.app/ru/network-analysis/directed-betweenness-centrality
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Центральность по посредничествуСетевой анализ↔ compare
- Центральность по направленной близостиСетевой анализ↔ compare
- Направленная центральность по собственному векторуСетевой анализ↔ compare
- Directed PageRankСетевой анализ↔ compare
- Анализ направленных социальных сетейСетевой анализ↔ compare
Упоминается в
Нашли ошибку на этой странице? Сообщите о ней или предложите исправление →