arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.04086physics.soc-ph
收藏

可达性:结点度(A_∞)的推广

Accessibility: A Generalization of the Node Degree (A Tutorial)

Alexandre Benatti, Luciano da F. Costa

摘要:

复杂网络拓扑性质的鲁棒和全面的表征需要采用几种不同的度量,其中节点度具有特殊的重要性。在目前的工作中,我们提供了一个介绍这些测量,即节点的可访问性,这可以被理解为节点度的概念的泛化,不仅纳入该节点的连续邻域,但也反映了特定类型的动态展开在网络中。在讨论了节点度及其层次扩张后,提出了随机游动、熵和可达性的概念。给出了几个数值计算的例子,实验结果表明,它可以有效地补充Erdos-Renyi、Watts-Strogatz、Barabasi-Albert和Geometric四类复杂网络的其他拓扑度量所提供的信息.我们还介绍了如何最近开发的工具箱可以用于计算在相对较大的网络的可访问性。

英文摘要:

Robust and comprehensive characterization of the topological properties of complex networks requires the adoption of several respective measurements, among which the node degree has special importance. In the present work, we provide an introduction to one of these measurements, namely the accessibility of a node, which can be understood as a generalization of the concept of node degree not only to incorporate successive neighborhoods of that node, but also to reflect specific types of dynamics unfolding in the network. After discussing the node degree and its hierarchical extension, we present the concepts of random walk, entropy, and then the accessibility. Several examples of its numeric calculation are provided, as well as some experimental results indicating that it can effectively complement the information provided by other topological measurements of four types of complex networks, namely Erdos-Renyi, Watts-Strogatz, Barabasi-Albert, and Geometric. We also describe how a recently developed toolbox can be used for the calculation of accessibility in relatively large networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑