%0 Journal Article %1 opsahl_node_2010 %A Opsahl, Tore %A Agneessens, Filip %A Skvoretz, John %D 2010 %J Social Networks %K centrality, networks weighted %N 3 %P 245--251 %R 10.1016/j.socnet.2010.03.006 %T Node centrality in weighted networks: Generalizing degree and shortest paths %U http://www.sciencedirect.com/science/article/pii/S0378873310000183 %V 32 %X 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.

@article{opsahl_node_2010, 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.}, added-at = {2017-01-09T13:57:26.000+0100}, author = {Opsahl, Tore and Agneessens, Filip and Skvoretz, John}, biburl = {https://www.bibsonomy.org/bibtex/283a66aeed2fdbf9bc3ede10fd765dd60/yourwelcome}, doi = {10.1016/j.socnet.2010.03.006}, interhash = {9829238da0ff7881ef4be3d1b99ec7e1}, intrahash = {83a66aeed2fdbf9bc3ede10fd765dd60}, issn = {0378-8733}, journal = {Social Networks}, keywords = {centrality, networks weighted}, month = jul, number = 3, pages = {245--251}, shorttitle = {Node centrality in weighted networks}, timestamp = {2017-01-09T14:01:11.000+0100}, title = {Node centrality in weighted networks: {Generalizing} degree and shortest paths}, url = {http://www.sciencedirect.com/science/article/pii/S0378873310000183}, urldate = {2013-12-15}, volume = 32, year = 2010 }