Metodebevisregistrering
Closeness Centrality
Closeness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts.
Kilderegistrering
Citater kopieret ordret fra metodens kilderegistrering. Ingen påstandsniveauverifikation er udledt heraf.
Closeness Centrality (Bavelas-Freeman Shortest-Path Measure)
Taksonomisk metoderegistrering · ml-model / network-analysis
- Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239. · DOI 10.1016/0378-8733(78)90021-7
- Bavelas, A. (1950). Communication patterns in task-oriented groups. Journal of the Acoustical Society of America, 22(6), 725–730. · DOI 10.1121/1.1906679
Kuraterede påstande
Påstande gemt i bevis-loggen, hver med sin egen vurdering.
Ingen kuraterede påstande endnu
Denne visning opfinder ikke en påstandsvurdering, når loggen ingen har.
Relaterede metoder
Genereret fra metodegrafen og vist som maskinelt foreslåede relationer — ingen bevispåstand er udledt.