Geographic routing in social networks

被引:415
作者
Liben-Nowell, D
Novak, J
Kumar, R
Raghavan, P
Tomkins, A
机构
[1] Carleton Coll, Dept Math & Comp Sci, Northfield, MN 55057 USA
[2] IBM Corp, Almaden Res Ctr, San Jose, CA 95120 USA
[3] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
[4] Yahoo, Res Labs, Sunnyvale, CA 94089 USA
[5] Ver Inc, Sunnyvale, CA 94089 USA
关键词
routing algorithms; small worlds; population networks; rank-based friendships; six degrees of separation;
D O I
10.1073/pnas.0503018102
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
We live in a "small world," where two arbitrary people are likely connected by a short chain of intermediate friends. With scant information about a target individual, people can successively forward a message along such a chain. Experimental studies have verified this property in real social networks, and theoretical models have been advanced to explain it. However, existing theoretical models have not been shown to capture behavior in real-world social networks. Here, we introduce a richer model relating geography and social-network friendship, in which the probability of befriending a particular person is inversely proportional to the number of closer people. In a large social network, we show that one-third of the friendships are independent of geography and the remainder exhibit the proposed relationship. Further, we prove analytically that short chains can be discovered in every network exhibiting the relationship.
引用
收藏
页码:11623 / 11628
页数:6
相关论文
共 36 条
[1]  
Adamic L.A., 2002, LOCAL SEARCH UNSTRUC
[2]   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
[3]  
ADAMIC LA, 2003, E PRINT ARCH
[4]   A GRAPH-THEORETIC GAME, AND ITS APPLICATION TO THE K-SERVER PROBLEM [J].
ALON, N ;
KARP, RM ;
PELEG, D ;
WEST, D .
SIAM JOURNAL ON COMPUTING, 1995, 24 (01) :78-100
[5]  
[Anonymous], P 23 ANN ACM S PRINC
[6]  
[Anonymous], 2004, P TWENTYTHIRD ANN AC
[7]  
[Anonymous], 2001, INT S DISTRIBUTED CO, DOI DOI 10.1007/3-540-45414-4_19
[8]  
[Anonymous], 2018, RSAI NEWSL NEW SER
[9]  
[Anonymous], 1994, SOCIAL NETWORK ANAL
[10]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512