Identity and search in social networks

被引:532
作者
Watts, DJ [1 ]
Dodds, PS
Newman, MEJ
机构
[1] Columbia Univ, Dept Sociol, New York, NY 10027 USA
[2] Columbia Univ, Columbia Earth Inst, New York, NY 10027 USA
[3] Santa Fe Inst, Santa Fe, NM 87501 USA
关键词
D O I
10.1126/science.1070120
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Social networks have the surprising property of being "searchable": Ordinary people are capable of directing messages through their network of acquaintances to reach a specific but distant target person in only a few steps. We present a model that offers an explanation of social network searchability in terms of recognizable personal identities: sets of characteristics measured along a number of social dimensions. Our model defines a class of searchable networks and a method for searching them that may be applicable to many network search problems, including the location of data files in peer-to-peer networks, pages on the World Wide Web, and information in distributed databases.
引用
收藏
页码:1302 / 1305
页数:4
相关论文
共 18 条
[1]   Search in power-law networks [J].
Adamic, L.A. ;
Lukose, R.M. ;
Puniyani, A.R. ;
Huberman, B.A. .
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 2001, 64 (4 II) :461351-461358
[2]  
[Anonymous], 2000, P 32 ANN ACM S THEOR, DOI DOI 10.1145/335305.335325
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   STUDYING SOCIAL-RELATIONS CROSS-CULTURALLY [J].
BERNARD, HR ;
KILLWORTH, PD ;
EVANS, MJ ;
MCCARTY, C ;
SHELLEY, GA .
ETHNOLOGY, 1988, 27 (02) :155-179
[5]  
Bollobas B, 1985, RANDOM GRAPHS
[6]   DUALITY OF PERSONS AND GROUPS [J].
BREIGER, RL .
SOCIAL FORCES, 1974, 53 (02) :181-190
[7]   REVERSAL SMALL-WORLD EXPERIMENT [J].
KILLWORTH, PD ;
BERNARD, HR .
SOCIAL NETWORKS, 1978, 1 (02) :159-192
[8]   Path finding strategies in scale-free networks [J].
Kim, BJ ;
Yoon, CN ;
Han, SK ;
Jeong, H .
PHYSICAL REVIEW E, 2002, 65 (02)
[9]   Navigation in a small world - It is easier to find short chains between points in some networks than others. [J].
Kleinberg, JM .
NATURE, 2000, 406 (6798) :845-845
[10]  
MANNEVILLE B, 1999, BIOL BUSINESS DECODI, pCH5