Lower bound of assortativity coefficient in scale-free networks

Abstract

The degree-degree correlation is important in understanding the structural organization of a network and the dynamics upon a network. Such correlation is usually measured by the assortativity coefficient $r$, with natural bounds $r\in [-1,1]$. For scale-free networks with power-law degree distribution $p(k)\sim k^{-\gamma }$, we analytically obtain the lower bound of assortativity coefficient in the limit of large network size, which is not -1 but dependent on the power-law exponent $\gamma$. This work challenges the validation of assortativity coefficient in heterogeneous networks, suggesting that one cannot judge whether a network is positively or negatively correlated just by looking at its assortativity coefficient.

9 pages, 5 figures and 1 Table

References in corpus (13)

• Power-law distributions in empirical data
• Statistical physics of social dynamics
• Synchronization in complex networks
• Evolutionary games on graphs
• Critical phenomena in complex networks
• Vital nodes identification in complex networks
• The entropy of randomized network ensembles
• Efficient and exact sampling of simple graphs with given arbitrary degree sequence
• Performance of networks of artificial neurons: The role of clustering
• Structural constraints in complex networks
• Reciprocity of Networks with Degree Correlations and Arbitrary Degree Sequences
• Degree correlations in directed scale-free networks
• Crossover phenomena of percolation transition in evolution networks with hybrid attachment

Cited by in corpus (7)

• Network constraints on the mixing patterns of binary node metadata
• Misinformation spreading on correlated multiplex networks
• Assortative Mixing in Weighted Directed Networks
• Containing rumors spreading on correlated multiplex networks
• Mechanisms for tuning clustering and degree-correlations in directed networks
• Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks
• Nonmonotonic percolation threshold in correlated networks and hypergraphs