On neighbourhood degree sequences of complex networks

Smith, Keith M. (2019) On neighbourhood degree sequences of complex networks. Scientific Reports, 9 (1). pp. 1-11. 8340. ISSN 2045-2322 (https://doi.org/10.1038/s41598-019-44907-8)

[thumbnail of Smith-SR2019-On-neighbourhood-degree-sequences-complex-networks]
Text. Filename: Smith-SR2019-On-neighbourhood-degree-sequences-complex-networks.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (1MB)| Preview


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 organization in these sequences, as well as updating the notion of hierarchical complexity to reflect previously unnoticed organizational principles. We also point out that neighbourhood degree sequences are related to a powerful subtree kernel for unlabeled 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.