社交网络中基于类别的路由研究
Remarks on Category-Based Routing in Social Networks
摘要：
众所周知，个人可以通过社交网络在短路径上路由消息，仅给出关于目标的简单信息并且仅使用关于拓扑的本地知识。社会学家推测，人们通过将消息传递给与目标有更多共同点的熟人来找到更好的路线，例如，如果萨尔布吕肯的牙医想向慕尼黑的某个律师发送消息，他可能会将其转发给律师和/或住在慕尼黑的人。Eppstein等人对这种设置进行建模，引入了基于类别的路由的概念。我们的目标是为图中的每个节点分配一组类别，从而使贪婪路由成为可能。通过证明一个节点所处的类别数量的界限，我们可以讨论底层社会学模型的可解释性。在本文中，我们大大提高了Eppstein等人提出的上界，并证明了新的下界。
英文摘要：
It is well known that individuals can route messages on short paths through social networks, given only simple information about the target and using only local knowledge about the topology. Sociologists conjecture that people find routes greedily by passing the message to an acquaintance that has more in common with the target than themselves, e.g. if a dentist in Saarbrücken wants to send a message to a specific lawyer in Munich, he may forward it to someone who is a lawyer and/or lives in Munich. Modelling this setting, Eppstein et al. introduced the notion of category-based routing. The goal is to assign a set of categories to each node of a graph such that greedy routing is possible. By proving bounds on the number of categories a node has to be in we can argue about the plausibility of the underlying sociological model. In this paper we substantially improve the upper bounds introduced by Eppstein et al. and prove new lower bounds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
