总通信性作为中心性度量
Total communicability as a centrality measure
AI总结:
提出基于网络邻接矩阵指数行和的总通信性作为节点中心性度量,并证明其计算高效性及作为网络连通性指标的有效性。
摘要:
我们研究了一种基于总通信性概念的节点中心性度量,该度量由网络邻接矩阵指数的行和定义。我们认为这是网络中节点排序的自然度量,并指出即使在大型网络中也能快速计算。此外,我们提出节点总通信性的总和作为网络连通性的有用度量。为了将此中心性度量与密切相关的子图中心性[E. Estrada and J. A. Rodriguez-Velazquez, Phys. Rev. E, 71 (2005), 056103]和Katz中心性[L. Katz, Psychometrica, 18 (1953), pp. 39-43]进行比较,进行了广泛的数值研究。计算中使用了合成网络和真实网络。
英文摘要:
We examine a node centrality measure based on the notion of total communicability, defined in terms of the row sums of the exponential of the adjacency matrix of the network. We argue that this is a natural metric for ranking nodes in a network, and we point out that it can be computed very rapidly even in the case of large networks. Furthermore, we propose the total sum of node communicabilities as a useful measure of network connectivity. Extensive numerical studies are conducted in order to compare this centrality measure with the closely related ones of subgraph centrality [E. Estrada and J. A. Rodriguez-Velazquez, Phys. Rev. E, 71 (2005), 056103] and Katz centrality [L. Katz, Psychometrica, 18 (1953), pp. 39-43]. Both synthetic and real-world networks are used in the computations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。