arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.1845physics.soc-phcs.SI
收藏

非均匀密度社交网络中的导航

Navigation in non-uniform density social networks

Yanqing Hu, Yong Li, Zengru Di, Ying Fan

摘要:

最近的实证研究表明,社交网络的空间结构具有普遍的标度律。发现个体在距离$d$处有朋友的概率密度分布为$P(d)\propto d^{-1}$。针对真实社交网络中种群密度不均匀的特点,基于上述经验规律,引入了一种尺度不变的友谊网络(SIFN)来刻画这一现象.我们证明了二维SIFN中导航的时间复杂度至多为$O(\log^4 n)$。在真实的搜索实验中,人们往往会求助于地理位置之外的额外信息。因此,现实世界的搜索过程可以被视为$k$维SIFN($k>2$)中的导航的投影。因此,我们还讨论了高,低维SIFN之间的关系。特别地,我们证明了一个2维SIFN是一个3维SIFN的投影。事实上,该结果也可以生成到任何$k$维SIFN。

英文摘要:

Recent empirical investigations suggest a universal scaling law for the spatial structure of social networks. It is found that the probability density distribution of an individual to have a friend at distance $d$ scales as $P(d)\propto d^{-1}$. Since population density is non-uniform in real social networks, a scale invariant friendship network(SIFN) based on the above empirical law is introduced to capture this phenomenon. We prove the time complexity of navigation in 2-dimensional SIFN is at most $O(\log^4 n)$. In the real searching experiment, individuals often resort to extra information besides geography location. Thus, real-world searching process may be seen as a projection of navigation in a $k$-dimensional SIFN($k>2$). Therefore, we also discuss the relationship between high and low dimensional SIFN. Particularly, we prove a 2-dimensional SIFN is the projection of a 3-dimensional SIFN. As a matter of fact, this result can also be generated to any $k$-dimensional SIFN.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑