Tail-scope:使用朋友来估计大规模复杂网络中度分布的重尾
Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks
摘要:
自然和社会现象中的许多复杂网络往往具有重尾度分布的特征。然而,由于网络数据规模的快速增长以及对使用这些数据的隐私问题的担忧,分析完整的数据集变得更加困难。因此,它是至关重要的,以设计有效的和高效的估计方法,在大规模的网络中的度分布的重尾仅使用一小部分采样节点的局部信息。在这里,我们提出了一个基于友谊悖论的局部观察偏差的尾范围方法。我们发现,尾部范围的方法优于均匀节点抽样估计度分布的重尾,而相反的趋势是在小度的范围内观察。为了充分利用这两种采样方法的优点,我们设计了混合方法,成功地恢复了整个范围的度分布。我们的尾范围方法显示了如何大规模复杂网络的结构异质性可以被用来有效地揭示网络结构,只有有限的本地信息。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。