Vertex similarity in networks

Citation

Leicht, E. A.; Holme, P.; & Newman, M. E. (2006). Vertex similarity in networks. Phys Rev E Stat Nonlin Soft Matter Phys. vol. 73 (2 Pt 2) pp. 026120

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.

Keyword(s)

Animals

Notes

Leicht, E A

Reference Type

Journal Article

Journal Title

Phys Rev E Stat Nonlin Soft Matter Phys

Author(s)

Leicht, E. A.
Holme, P.
Newman, M. E.

Year Published

2006

Volume Number

73

Issue Number

2 Pt 2

Edition

2006/04/12

ISSN/ISBN

1539-3755 (Print)

DOI

1539-3755 (Print)

Reference ID

1782