Vertex similarity in networks
- 17 February 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 73 (2), 026120
- https://doi.org/10.1103/physreve.73.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.Keywords
This publication has 32 references indexed in Scilit:
- Average path length in random networksPhysical Review E, 2004
- Scale-Free Networks Are UltrasmallPhysical Review Letters, 2003
- The Structure and Function of Complex NetworksSIAM Review, 2003
- The average distances in random graphs with given expected degreesProceedings of the National Academy of Sciences of the United States of America, 2002
- Community structure in social and biological networksProceedings of the National Academy of Sciences of the United States of America, 2002
- Evolution of networksAdvances in Physics, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Connectivity of Growing Random NetworksPhysical Review Letters, 2000
- Structure of Growing Networks with Preferential LinkingPhysical Review Letters, 2000
- Collective dynamics of ‘small-world’ networksNature, 1998