Eom Young-Ho, Jo Hang-Hyun
1] Laboratoire de Physique Théorique du CNRS, IRSAMC, Université de Toulouse, UPS, F-31062 Toulouse, France [2] IMT Institute for Advanced Studies Lucca, Piazza San Francesco 19, Lucca 55100, Italy.
1] BK21plus Physics Division and Department of Physics, Pohang University of Science and Technology, Pohang 790-784, Republic of Korea [2] BECS, Aalto University School of Science, P.O. Box 12200, FI-00076, Finland.
Sci Rep. 2015 May 11;5:9752. doi: 10.1038/srep09752.
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes more difficult to analyze complete data sets. Thus, it is crucial to devise effective and efficient estimation methods for heavy tails of degree distributions in large-scale networks only using local information of a small fraction of sampled nodes. Here we propose a tail-scope method based on local observational bias of the friendship paradox. We show that the tail-scope method outperforms the uniform node sampling for estimating heavy tails of degree distributions, while the opposite tendency is observed in the range of small degrees. In order to take advantages of both sampling methods, we devise the hybrid method that successfully recovers the whole range of degree distributions. Our tail-scope method shows how structural heterogeneities of large-scale complex networks can be used to effectively reveal the network structure only with limited local information.
自然和社会现象中的许多复杂网络通常具有重尾度分布特征。然而,由于网络数据规模迅速增长以及对使用这些数据的隐私问题的担忧,分析完整数据集变得更加困难。因此,仅使用一小部分采样节点的局部信息来设计针对大规模网络度分布重尾的有效且高效的估计方法至关重要。在此,我们基于友谊悖论的局部观测偏差提出一种尾范围方法。我们表明,在估计度分布的重尾时,尾范围方法优于均匀节点采样,而在小度数范围内观察到相反的趋势。为了利用这两种采样方法的优势,我们设计了一种混合方法,该方法成功恢复了度分布的整个范围。我们的尾范围方法展示了如何仅利用有限的局部信息,通过大规模复杂网络的结构异质性来有效揭示网络结构。