论文标题
加权网络中节点中心性的极值分析
Extrema Analysis of Node Centrality in Weighted Networks
论文作者
论文摘要
网络科学的一个非常有趣的问题是评估给定网络的复杂程度。换句话说，通过这种网络的数量与任何一般模式不同，这些模式可以引起其描述。在其他选择中，可以根据节点或边缘属性来定义这些模式，这是各种中心性模式之一。尽管有针对加权图定义的中心性指数，但有关该主题的讨论还远远没有结束，尤其是因为这方面的边缘权重的影响不仅在形式上而且强度也有所不同，到目前为止，仍然是一种初期的方法。对于上述复杂性评估，情况更加敏锐：据我们所知，从加权图中的中心性的角度来看，文献中从未解决过。本文以丰富多彩的方式详细介绍了涵盖主题的合理方法，以及在这种情况下确认其实际适用性和未来趋势的实验。
A very interesting matter of Network Science is assessing how complex a given network is. In other words, by how much does such a network departs from any general patterns which could be evoked for its description. Among other choices, these patterns can be defined in terms of node or edge properties, as one of the various modes of centrality. Although there are centrality indexes defined for weighted graphs, the discussions on this subject are far from over, especially because the influence of edge weights in this regard can vary not only in form but also in intensity, a still incipient approach so far. For the aforementioned complexity evaluation, the situation is even more acute: to the best of our knowledge, this was never addressed in the literature, from the standpoint of centrality in weighted graphs. This paper details in a colorful fashion a sound methodology covering both topics, as well as experiments confirming its practical applicability and future trends in this context.
