Measure the similarity of nodes in the complex networks
arXiv:1502.00780
Abstract
Measure the similarity of the nodes in the complex networks have interested many researchers to explore it. In this paper, a new method which is based on the degree centrality and the Relative-entropy is proposed to measure the similarity of the nodes in the complex networks. The results in this paper show that, the nodes which have a common structure property always have a high similarity to others nodes. The nodes which have a high influential to others always have a small value of similarity to other nodes and the marginal nodes also have a low similar to other nodes. The results in this paper show that the proposed method is useful and reasonable to measure the similarity of the nodes in the complex networks.
arXiv comment6 figures
References in corpus (12)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Synchronization in complex networks
- Predicting Missing Links via Local Information
- Self-similarity of complex networks
- Vertex similarity in networks
- Degree mixing in multilayer networks impedes the evolution of cooperation
- Creative elements: network-based predictions of active centres in proteins, cellular and social networks
- A Large-Scale Community Structure Analysis In Facebook
- A new information dimension of complex networks
- Tsallis information dimension of complex networks
- Local structure entropy of complex networks