Machine learningNetwork science

Centralnost usmjerenog posredovanja

Centralnost usmjerenog posredovanja proširuje Freemanovu klasičnu mjeru posredovanja na usmjerene grafove, kvantificirajući koliko često se čvor nalazi na najkraćim usmjerenim putovima između svih ostalih parova čvorova. Ona identificira čuvare vrata, posrednike i uska grla u asimetričnim tokovima kao što su informacijske kaskade, citatne mreže i organizacijske hijerarhije.

Otvorite u MethodMindUskoroVideoUskoroDownload slides

Pročitajte cijelu metodu

Samo za članove

Prijavite se besplatnim računom kako biste pročitali ovaj odjeljak.

Prijavite se

Method map

The neighbourhood of related methods — select a node to explore.

Izvori

  1. Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35–41. DOI: 10.2307/3033543
  2. 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/hr/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 side by side

Citirana u

ScholarGateDirected Betweenness Centrality (Directed Betweenness Centrality (Freeman's Betweenness on Directed Graphs)). Preuzeto 2026-06-15 s https://scholargate.app/hr/network-analysis/directed-betweenness-centrality · Skup podataka: https://doi.org/10.5281/zenodo.20539026