Vertex similarity in networks.

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.

[1]  刘金明,et al.  IL-13受体α2降低血吸虫病肉芽肿的炎症反应并延长宿主存活时间[英]/Mentink-Kane MM,Cheever AW，Thompson RW，et al//Proc Natl Acad Sci U S A , 2005 .

[2]  P. Holme,et al.  Role-similarity based functional prediction in networked systems: application to the yeast proteome , 2005, Journal of The Royal Society Interface.

[3]  P. Bearman,et al.  Chains of Affection: The Structure of Adolescent Romantic and Sexual Networks1 , 2004, American Journal of Sociology.

[4]  Paul Van Dooren,et al.  A MEASURE OF SIMILARITY BETWEEN GRAPH VERTICES . WITH APPLICATIONS TO SYNONYM EXTRACTION AND WEB SEARCHING , 2002 .

[5]  R. Guimerà,et al.  Modularity from fluctuations in random graphs and complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[7]  D. Goldberg,et al.  Assessing experimentally derived interactions in a small world , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[9]  S. Borgatti,et al.  Defining and measuring trophic role similarity in food webs using regular equivalence. , 2003, Journal of theoretical biology.

[10]  A. Fronczak,et al.  Average path length in random networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[12]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[14]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[15]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[17]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[18]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[20]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[21]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[22]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[23]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[25]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[26]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[27]  P. Watts.  Connections , 1994 .

[28]  Martin G. Everett,et al.  Two algorithms for computing regular equivalence , 1993 .

[29]  P. Gács,et al.  Algorithms , 1992 .

[30]  A. Ferligoj,et al.  An optimizational approach to regular equivalence , 1992 .

[31]  Ronald Rousseau,et al.  Similarity measures in scientometric research: The Jaccard index versus Salton's cosine formula , 1989, Inf. Process. Manag..

[32]  Gerard Salton,et al.  Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer , 1989 .

[33]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[34]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[35]  L. Ward.  Social Forces , 1911, The Psychological Clinic.

[36]  Betty Kirkpatrick,et al.  Roget's Thesaurus , 1852 .

[37]  Yong Qi,et al.  Information Processing and Management , 1984 .

[38]  A. Barabasi,et al.  Emergence of Scaling in Random Networks , 1999 .

[39]  George W. Davidson,et al.  Roget's Thesaurus of English Words and Phrases , 1982 .

[40]  Nouvelle Série,et al.  BULLETIN DE LA. , 1956 .

[41]  Taylor Francis Online.  Advances in physics , 1952 .