Vertex similarity in networks.
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.
Leicht
E A
EA
Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA.
Holme
Petter
P
Newman
M E J
ME
D000818:Animals; D003198:Computer Simulation; D006801:Humans; D008954:Models, Biological; D015233:Models, Statistical; D009415:Nerve Net / Q000502:physiology*; D015398:Signal Transduction / Q000502:physiology*; D012944:Social Support