Directed Betweenness Centrality
Directed Betweenness Centrality proširuje klasičnu meru centralnosti po posredovanju (betweenness centrality) Fremana na usmerene grafove, kvantifikujući koliko se često jedan čvor nalazi na najkraćim usmerenim putevima između svih ostalih parova čvorova. Ona identifikuje ključne igrače (gatekeepers), posrednike (brokers) i uska grla (bottlenecks) u asimetričnim tokovima kao što su informacione kaskade, citatne mreže i organizacione hijerarhije.
Pročitajte celu metodu
Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.
Method map
The neighbourhood of related methods — select a node to explore.
Izvori
- 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 ↗
Kako citirati ovu stranicu
ScholarGate. (2026, June 3). Directed Betweenness Centrality (Freeman's Betweenness on Directed Graphs). ScholarGate. https://scholargate.app/sr/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.
- MeđucentralnostAnaliza mreža↔ compare
- Usmerena bliskosna centralnostAnaliza mreža↔ compare
- Усмерена централност по сопственим векторимаAnaliza mreža↔ compare
- Directed PageRankAnaliza mreža↔ compare
- Analiza usmerenih društvenih mrežaAnaliza mreža↔ compare
Citirana u
Uočili ste grešku na ovoj stranici? Prijavite je ili predložite ispravku →