社交网络中基于类别的路由:成员维度和小世界现象
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short)
摘要:
米尔格拉姆(Milgram)的一个经典实验表明,在社交网络中,只要给出接收者的简单分类信息(比如“他是波士顿的一位著名律师”或“她是哈佛大学社会学专业的大一新生”),个人就可以沿着短路径发送消息。也就是说,这些网络在节点对之间有非常短的路径(所谓的小世界现象);此外,即使每个人只知道网络拓扑的一小部分,参与者也能够沿着这些路径路由消息。一些社会学家推测,在这种情况下,参与者使用贪婪的路由策略,其中他们转发消息给熟人,这些熟人与收件人有更多的共同类别,而最近提出了类似的策略,用于移动设备的动态ad-hoc网络中的消息路由。在本文中,我们引入了一个网络属性,称为成员维度,它表征了在社会网络中保持参与者和类别之间的关系所需的认知负荷。我们表明,任何连接的网络有一个系统的类别,将支持贪婪路由,但这些类别可以有小的成员维,当且仅当底层网络表现出小世界现象。
英文摘要:
A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as "he is a prominent lawyer in Boston" or "she is a Freshman sociology major at Harvard"). That is, these networks have very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a greedy routing strategy in which they forward messages to acquaintances that have more categories in common with the recipient than they do, and similar strategies have recently been proposed for routing messages in dynamic ad-hoc networks of mobile devices. In this paper, we introduce a network property called membership dimension, which characterizes the cognitive load required to maintain relationships between participants and categories in a social network. We show that any connected network has a system of categories that will support greedy routing, but that these categories can be made to have small membership dimension if and only if the underlying network exhibits the small-world phenomenon.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。