Node matching between complex networks.

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.