关于复杂网络的邻域度序列
On neighbourhood degree sequences of complex networks
摘要:
网络拓扑是网络科学的一个基本方面,它使我们能够深入了解我们所居住的世界的复杂关系架构。我们提供了第一个具体的研究复杂网络中的邻域度序列。我们考虑如何明确地描述重要的物理概念,如相似性,异质性和组织在这些序列中,以及更新的概念层次复杂性,以反映以前未被注意的组织原则。我们还指出,邻域度序列与一个强大的子树核无标号图分类。我们研究了这些新定义的序列属性在一个全面的数组的图形模型和超过200个现实世界的网络。我们发现,这些指数既不高度相关,彼此也不与经典的网络指数。重要的是,我们发现各种各样的真实世界网络的序列比给定度分布的网络具有更大的相似性和组织性。值得注意的是,虽然生物、社会和技术网络都表现出一贯的大邻域相似性和组织性,但层次复杂性并不是现实世界网络的一贯特征。邻域度序列是描述复杂网络独特而重要的特征的一个有趣的工具。
英文摘要:
Network topology is a fundamental aspect of network science that allows us to gather insights into the complicated relational architectures of the world we inhabit. We provide a first specific study of neighbourhood degree sequences in complex networks. We consider how to explicitly characterise important physical concepts such as similarity, heterogeneity and organisation in these sequences, as well as updating the notion of hierarchical complexity to reflect previously unnoticed organisational principles. We also point out that neighbourhood degree sequences are related to a powerful subtree kernel for unlabelled graph classification. We study these newly defined sequence properties in a comprehensive array of graph models and over 200 real-world networks. We find that these indices are neither highly correlated with each other nor with classical network indices. Importantly, the sequences of a wide variety of real world networks are found to have greater similarity and organisation than is expected for networks of their given degree distributions. Notably, while biological, social and technological networks all showed consistently large neighbourhood similarity and organisation, hierarchical complexity was not a consistent feature of real world networks. Neighbourhood degree sequences are an interesting tool for describing unique and important characteristics of complex networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。