Node centrality in weighted networks: Generalizing degree and shortest paths

被引：2481

作者：

Opsahl, Tore ^{[1
]}

Agneessens, Filip ^{[2
]}

Skvoretz, John ^{[3
]}

机构：

[1] Univ London Imperial Coll Sci Technol & Med, Imperial Coll Business Sch, London SW7 2AZ, England

[2] Vrije Univ Amsterdam, Dept Org Sci, NL-1081 HV Amsterdam, Netherlands

[3] Univ S Florida, Coll Arts & Sci, Tampa, FL 33620 USA

来源：

SOCIAL NETWORKS | 2010年 / 32卷 / 03期

关键词：

Degree; Closeness; Betweenness; Weighted networks; STRENGTH;

D O I：

10.1016/j.socnet.2010.03.006

中图分类号：

Q98 [人类学];

学科分类号：

030303 ;

摘要：

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. (C) 2010 Elsevier B.V. All rights reserved.

引用

页码：245 / 251

页数：7

共 29 条

[1]

[Anonymous], 2005, Generalized Blockmodeling

[2]

[Anonymous], 1995, Network Models of the Diffusion of Innovations

[3] The architecture of complex weighted networks [J].