Change search
ReferencesLink to record
Permanent link

Direct link
Vertex similarity in networks
2006 (English)In: Physical Review E, ISSN 1539-3755, Vol. 73, no 2Article in journal (Refereed) Published
Abstract [en]

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
Keyword [en]
regular equivalence, complex networks, random graphs, small-world
URN: urn:nbn:se:kth:diva-15469DOI: 10.1103/PhysRevB.73.026120ISI: 000235667700034OAI: diva2:333510
QC 20100525Available from: 2010-08-05 Created: 2010-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Holme, Petter

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link