Rettet "Betweenness Centrality"
Rettet "Betweenness Centrality" udvider Freemans klassiske "betweenness"-mål til rettede grafer og kvantificerer, hvor ofte en knude ligger på de korteste rettede stier mellem alle andre par af knuder. Den identificerer "gatekeepers", mæglere og flaskehalse i asymmetriske strømme som informationskaskader, citationsnetværk og organisatoriske hierarkier.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- 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 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Directed Betweenness Centrality (Freeman's Betweenness on Directed Graphs). ScholarGate. https://scholargate.app/da/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.
- Betweenness CentralityNetværksanalyse↔ compare
- Rettet NærhedscentralitetNetværksanalyse↔ compare
- Rettet egenvektorcentralitetNetværksanalyse↔ compare
- Directed PageRankNetværksanalyse↔ compare
- Rettet social netværksanalyseNetværksanalyse↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →