Analysis and perturbation of degree correlation in complex networks
arXiv:1505.04394 · doi:10.1209/0295-5075/111/48003
Abstract
Degree correlation is an important topological property common to many real-world networks. In this paper, the statistical measures for characterizing the degree correlation in networks are investigated analytically. We give an exact proof of the consistency for the statistical measures, reveal the general linear relation in the degree correlation, which provide a simple and interesting perspective on the analysis of the degree correlation in complex networks. By using the general linear analysis, we investigate the perturbation of the degree correlation in complex networks caused by the addition of few nodes and the rich club. The results show that the assortativity of homogeneous networks such as the ER graphs is easily to be affected strongly by the simple structural changes, while it has only slight variation for heterogeneous networks with broad degree distribution such as the scale-free networks. Clearly, the homogeneous networks are more sensitive for the perturbation than the heterogeneous networks.
5 pages, 4 figures
References in corpus (10)
- The entropic origin of disassortativity in complex networks
- Synchronization in weighed scale-free networks with degree-degree correlation
- Spreading dynamics on small-world networks with connectivity fluctuations and correlations
- Generating random networks with given degree-degree correlations and degree-dependent clustering
- Optimizing transport efficiency on scale-free networks through assortative or dissortative topology
- Correlations in complex networks under attack
- Impact of network structure on a model of diffusion and competitive interaction
- Synchronization in Scale Free networks with degree correlation
- Percolation transition in correlated hypergraphs
- Jamming in complex networks with degree correlation