互联网图的K-核分解:层次结构、自相似性和度量偏差
K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases
摘要:
我们认为,$k$核心分解的网络模型和互联网图在自治系统(AS)的水平。$k$ -核心分析允许表征度分布之外的网络,并揭示由于系统的特定架构而导致的结构属性和层次结构。我们比较了AS图的$k$ -核心结构与几个网络模型,并讨论了与真实的互联网架构的差异和相似之处。存在的偏见和不完整的真实地图进行了讨论,并评估其影响的$k$核心分析与数值实验模拟偏勘探范围广泛的网络模型。我们发现,$k$核心分析提供了一个有趣的特征的波动和不完整的地图,以及信息,帮助区分原来的底层结构。
英文摘要:
We consider the $k$-core decomposition of network models and Internet graphs at the autonomous system (AS) level. The $k$-core analysis allows to characterize networks beyond the degree distribution and uncover structural properties and hierarchies due to the specific architecture of the system. We compare the $k$-core structure obtained for AS graphs with those of several network models and discuss the differences and similarities with the real Internet architecture. The presence of biases and the incompleteness of the real maps are discussed and their effect on the $k$-core analysis is assessed with numerical experiments simulating biased exploration on a wide range of network models. We find that the $k$-core analysis provides an interesting characterization of the fluctuations and incompleteness of maps as well as information helping to discriminate the original underlying structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。