Mathematic model of node matching based on adjacency matrix and evolutionary solutions.

Research on complex networks is becoming a very hot topic in recent years, among which node matching problem is an important issue. The aim of node matching problem is to find out the corresponding relations between the individuals of associated networks. Traditional node matching problem of networks always hypothesize that a proportion of matching nodes are known. However, if the ratio of matched nodes is very small, the matching accuracy of the remaining nodes cannot be evaluated accurately. What is more, we may have not any matched nodes for reference at all. In view of this, this paper established the mathematic model of node matching problem based on the adjacency matrixes of networks, and presented an evolutionary algorithm to solve it. The experimental results show that the proposed method can achieve satisfactory matching precision in the absence of any matched nodes. [ABSTRACT FROM AUTHOR]