On variants of shortest-path betweenness centrality and their generic computation

被引：604

作者：

Brandes, Ulrik ^{[1
]}

机构：

[1] Univ Konstanz, Dept Comp & Informat Sci, Constance, Germany

来源：

SOCIAL NETWORKS | 2008年 / 30卷 / 02期

关键词：

betweenness centrality; algorithms; valued networks; load centrality;

D O I：

10.1016/j.socnet.2007.11.001

中图分类号：

Q98 [人类学];

学科分类号：

030303 ;

摘要：

Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：136 / 145

页数：10

共 33 条

[21] MEASURES OF BETWEENNESS IN NON-SYMMETRIC NETWORKS [J].

GOULD, RV .

SOCIAL NETWORKS, 1987, 9 (03) :277-282

[22]

Kleinberg J. M., 2006, Algorithm Design

[23]

Koschutzki D, 2005, CENTRALITY INDICES

[24] Scaling laws in the spatial structure of urban road networks [J].

Lämmer, S ;

Gehlsen, B ;

Helbing, D .

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2006, 363 (01) :89-95

[25]

MOODY JW, 2006, SUNB 26 SOC NETW C V

[26] Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality (vol 64, pg 016132, 2001) [J].

Newman, MEJ .

PHYSICAL REVIEW E, 2006, 73 (03)

[27] A measure of betweenness centrality based on random walks [J].

Newman, MEJ .

SOCIAL NETWORKS, 2005, 27 (01) :39-54

[28] Finding and evaluating community structure in networks [J].

Newman, MEJ ;

Girvan, M .

PHYSICAL REVIEW E, 2004, 69 (02) :026113-1

[29] Scientific collaboration networks. I. Network construction and fundamental results [J].

Newman, MEJ .

PHYSICAL REVIEW E, 2001, 64 (01) :8

[30] Balancing systematic and flexible exploration of social networks [J].

Perer, Adam ;

Shneiderman, Ben .

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2006, 12 (05) :693-700

← 1 2 3 4 →