Node centrality in weighted networks: Generalizing degree and shortest paths

T. Opsahl, F. Agneessens, J. Skvoretz

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

Ties often have a strength naturally associated with them that differentiate them from each other. Tie strength has been operationalized as weights. A few network measures have been proposed for weighted networks, including three common measures of node centrality: degree, closeness, and betweenness. However, these generalizations have solely focused on tie weights, and not on the number of ties, which was the central component of the original measures. This paper proposes generalizations that combine both these aspects. We illustrate the benefits of this approach by applying one of them to Freeman's EIES dataset. © 2010 Elsevier B.V.
Original languageEnglish
Pages (from-to)245-251
JournalSocial Networks
Volume32
Issue number3
DOIs
Publication statusPublished - 2010

Fingerprint

Dive into the research topics of 'Node centrality in weighted networks: Generalizing degree and shortest paths'. Together they form a unique fingerprint.

Cite this