CENTRALITY IN VALUED GRAPHS - A MEASURE OF BETWEENNESS BASED ON NETWORK FLOW

被引：638

作者：

FREEMAN, LC ^{[1
]}

BORGATTI, SP ^{[1
]}

WHITE, DR ^{[1
]}

机构：

[1] UNIV S CAROLINA, DEPT SOCIOL, COLUMBIA, SC 29208 USA

来源：

SOCIAL NETWORKS | 1991年 / 13卷 / 02期

关键词：

D O I：

10.1016/0378-8733(91)90017-N

中图分类号：

Q98 [人类学];

学科分类号：

030303 ;

摘要：

A new measure of centrality, CF, is introduced. It is based on the concept of network flows. While conceptually similar to Freeman's original measure, CB, the new measure differs from the original in two important ways. First, CF is defined for both valued and non-valued graphs. This makes CF applicable to a wider variety of network datasets. Second, the computation of CF is not based on geodesic paths as is CB but on all the independent paths between all pairs of points in the network. © 1991.

引用

页码：141 / 154

页数：14

共 51 条

[1]

ALBA RD, 1973, J MATH SOCIOL, V3, P113, DOI 10.1080/0022250X.1973.9989826

[2]

[Anonymous], 1971, J MATH SOCIOL, DOI [DOI 10.1080/0022250X.1971.9989788, 10.1080/0022250X.1971.9989788]

[3]

[Anonymous], 1970, SOVIET MATH DOKL

[4]

Anthonisse J.M., 1971, STICHT MATH CENT MAT