将网络中心性方法按照理论特征划分为节点关联性、网络最短路和模拟流问题,并对现实网络的局域性、信息完备性和动态性进行了深入分析,在此基础上建立了中心性方法与实际网络之间的匹配关系.
The centralities suggested in literature are classified into three groups as nodes' correlations, networks' shortest paths and network stimulating flow problem. A match network is constructed between the centralities and real networks based on the analysis of node's domain, information maturity and dynamics property.