Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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
Identifiers
URN: urn:nbn:se:kth:diva-15469ISI: 000235667700034OAI: oai:DiVA.org:kth-15469DiVA: diva2:333510
Note

QC 20100525

Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2017-05-19Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Holme, Petter

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 32 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf