Vertex similarity in networks

E. A. Leicht, Petter Holme, and M. E. J. Newman
Phys. Rev. E 73, 026120 – Published 17 February 2006

Abstract

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.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 21 October 2005

DOI:https://doi.org/10.1103/PhysRevE.73.026120

©2006 American Physical Society

Authors & Affiliations

E. A. Leicht, Petter Holme, and M. E. J. Newman

  • Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 73, Iss. 2 — February 2006

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×