Node matching between complex networks.
Node matching between complex networks.
复制标题
DOI：
10.1103/physreve.80.026103
复制
发表时间：
2009-08
期刊：
影响因子：
--
通讯作者：
Qi Xuan;Tie-Jun Wu
中科院分区：
文献类型：
--
作者：
Qi Xuan;Tie-Jun Wu
在多个不同的复杂系统中揭示专用个体的对应身份是许多领域的常见任务，本文将该任务转移到复杂网络之间的节点匹配问题。提出了一种可行的基于网络结构的节点匹配算法。通过我们的算法解决不同类型网络上的节点匹配问题，表明所研究的网络结构可能会显着影响最终的匹配结果。例如，我们发现在具有中等链接密度的随机网络上可以获得更高的匹配精度，并且小世界网络上的结果总是优于随机或规则网络上的结果。此外，在无标度网络中，中心节点似乎起着主导作用，即通过选择度数较大的节点作为显示的匹配节点，可以获得更好的匹配结果。这些发现将有助于我们将来设计更高效的节点匹配算法。
Revealing corresponding identities of a dedicated individual in several different complex systems is a common task in many areas, and this task is transferred to a node matching problem among complex networks in this paper. A feasible node matching algorithm based on network structure is proposed. Through solving node matching problems on different types of networks by our algorithm, it is revealed that the structure of the networks under study may significantly influence the final matching results. For example, it is found that higher matching precision can be obtained on random networks with moderate density of links, and the results on small-world networks are always better than those on random or regular networks. Moreover, in scale-free networks, it seems that hub nodes play dominant roles, i.e., better matching results can be expected by selecting nodes with larger degrees as the revealed matched nodes. These findings will help us design more efficient node matching algorithm in the future.