Geographic routing in social networks
Geographic routing in social networks
复制标题
DOI：
10.1073/pnas.0503018102
复制
发表时间：
2005-08-16
影响因子：
11.1
通讯作者：
Tomkins, A
中科院分区：
文献类型：
--
作者：
Liben-Nowell, D;Novak, J;Tomkins, A
我们生活在一个“小世界”里，两个任意的人可能通过一小串中间朋友联系在一起。由于缺乏关于目标个人的信息，人们可以沿着这样的链条沿着连续转发消息。实验研究已经在真实的社交网络中验证了这一特性，并提出了理论模型来解释这一现象，然而现有的理论模型并没有表现出真实世界社交网络中的行为。在这里，我们引入了一个更丰富的模型，将地理和社交网络友谊联系起来，其中与特定人成为朋友的概率与更亲密的人的数量成反比。在一个大型的社会网络中，我们发现，三分之一的友谊是独立的地理和其余的展览拟议的关系。此外，我们分析证明，短链可以发现在每个网络表现出的关系。
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.