Betweenness centrality in large complex networks
Betweenness centrality in large complex networks
复制标题
DOI：
10.1140/epjb/e2004-00111-4
复制
发表时间：
2004-03-01
影响因子：
1.6
通讯作者：
Barthélemy, M
中科院分区：
文献类型：
--
作者：
Barthélemy, M
我们分析了大型复杂网络中节点的介数中心性（BC）。一般来说，BC随着连通性的增加而增加，呈指数为eta的幂律。我们发现，对于具有小循环密度的树或网络，eta = 2，而较大的循环密度导致eta < 2。对于以描述连通性分布衰减的指数伽玛为特征的无标度网络，BC也按照具有非普适指数delta的幂律分布。我们表明，这个指数δ必须满足确切的界限δ大于或等于（伽马+1）/2。如果无标度网络是一棵树，那么我们有等式delta =（gamma + 1）/2。
We analyze the betweenness centrality (BC) of nodes in large complex networks. In general, the BC is increasing with connectivity as a power law with an exponent eta. We find that for trees or networks with a small loop density eta = 2 while a larger density of loops leads to eta < 2. For scale-free networks characterized by an exponent gamma which describes the connectivity distribution decay, the BC is also distributed according to a power law with a non universal exponent delta. We show that this exponent delta must satisfy the exact bound delta greater than or equal to (gamma + 1)/2. If the scale free network is a tree, then we have the equality delta = (gamma + 1)/2.