Vertex similarity in networks
Vertex similarity in networks
复制标题
DOI：
10.1103/physreve.73.026120
复制
发表时间：
2006-02-01
影响因子：
2.4
通讯作者：
Newman, MEJ
中科院分区：
文献类型：
--
作者：
Leicht, EA;Holme, P;Newman, MEJ
我们考虑了量化网络中顶点相似性的方法。我们提出了一种基于两个顶点相似的概念的相似性度量，如果它们在网络中的近邻本身相似。这导致了一个自洽的相似性矩阵公式，可以只使用网络邻接矩阵的知识来迭代地评估。我们在已知预期结果的计算机生成的网络和许多现实世界的网络上测试了我们的相似性度量。
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of similarity based on the concept that two vertices are similar if their immediate neighbors in the network are themselves similar. This leads to a self-consistent matrix formulation of similarity that can be evaluated iteratively using only a knowledge of the adjacency matrix of the network. We test our similarity measure on computer-generated networks for which the expected results are known, and on a number of real-world networks.