ScholarGate
Assistent
Machine learningNetwork science

Betweenness Centrality

Betweenness-sentralitet, formalisert av Linton C. Freeman i 1977, måler hvor ofte en node ligger på den korteste stien som forbinder ethvert annet par av noder i et nettverk. Noder med høy mellomliggende sentralitet fungerer som broer eller meglere: å fjerne dem fragmenterer nettverket i frakoblede komponenter mer alvorlig enn å fjerne andre noder.

Åpne i MethodMindSnartVideoSnartDownload slides

Les hele metoden

Kun for medlemmer

Logg inn med en gratis konto for å lese denne delen.

Logg inn

Method map

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

+16 more

Kilder

  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

Slik siterer du denne siden

ScholarGate. (2026, June 3). Betweenness Centrality (Freeman's Geodesic Betweenness). ScholarGate. https://scholargate.app/no/network-analysis/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

Referert av

ScholarGateBetweenness Centrality (Betweenness Centrality (Freeman's Geodesic Betweenness)). Hentet 2026-06-15 fra https://scholargate.app/no/network-analysis/betweenness-centrality · Datasett: https://doi.org/10.5281/zenodo.20539026