Explaining the emergence of complex networks through log-normal fitness in a Euclidean node similarity space
arXiv:1902.00336 · doi:10.1038/s41598-021-81547-3
Abstract
Networks of disparate phenomena-- be it the global ecology, human social institutions, within the human brain, or in micro-scale protein interactions-- exhibit broadly consistent architectural features. To explain this, we propose a new theory where link probability is modelled by a log-normal node fitness (surface) factor and a latent Euclidean space-embedded node similarity (depth) factor. Modelling based on this theory considerably outperforms popular power-law fitness and hyperbolic geometry explanations across 110 networks. Importantly, the degree distributions of the model resemble power-laws at small densities and log-normal distributions at larger densities, posing a reconciliatory solution to the long-standing debate on the nature and existence of scale-free networks. Validating this theory, a surface factor inversion approach on an economic world city network and an fMRI connectome results in considerably more geometrically aligned nearest neighbour networks. This establishes new foundations from which to understand, analyse, deconstruct and interpret network phenomena.
arXiv comment13 pages, 4 figures
References in corpus (19)
- Emergence of scaling in random networks
- Fast unfolding of communities in large networks
- Efficient Behavior of Small-World Networks
- Assortative mixing in networks
- Geometric deep learning: going beyond Euclidean data
- Specificity and stability in topology of protein networks
- Detecting rich-club ordering in complex networks
- Scale-free networks are rare
- Popularity versus Similarity in Growing Networks
- Random Geometric Graphs
- Generative models of the human connectome
- Self-similarity of complex networks and hidden metric spaces
- Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
- Scale-free Networks Well Done
- Evaluating Overfit and Underfit in Models of Network Community Structure
- All scale-free networks are sparse
- The hidden geometry of weighted complex networks
- The Complex Hierarchical Topology of EEG Functional Connectivity
- Normalised Degree Variance