Vertex similarity in networks
2006 (English)In: Physical Review E, ISSN 1539-3755, Vol. 73, no 2Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2006. Vol. 73, no 2
regular equivalence, complex networks, random graphs, small-world
IdentifiersURN: urn:nbn:se:kth:diva-15469DOI: 10.1103/PhysRevB.73.026120ISI: 000235667700034OAI: oai:DiVA.org:kth-15469DiVA: diva2:333510
QC 201005252010-08-052010-08-05Bibliographically approved