Lower bound of assortativity coefficient in scale-free networks
arXiv:1602.04350 · doi:10.1063/1.4976030
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 , with natural bounds . For scale-free networks with power-law degree distribution , 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 . 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.
arXiv comment9 pages, 5 figures and 1 Table
References in corpus (50)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community detection in graphs
- Power-law distributions in empirical data
- Assortative mixing in networks
- Statistical physics of social dynamics
- Epidemic processes in complex networks
- Random graphs with arbitrary degree distributions and their applications
- Synchronization in complex networks
- Multilayer Networks
- Evolution of networks
- Mixing patterns in networks
- Specificity and stability in topology of protein networks
- Evolutionary games on graphs
- Link Prediction in Complex Networks: A Survey
- Temporal Networks
- Spatial Networks
- Characterization of complex networks: A survey of measurements
- Critical phenomena in complex networks
- Hierarchical Organization in Complex Networks
- Coevolutionary games - a mini review
- Why social networks are different from other types of networks
- Vital nodes identification in complex networks
- Recommender Systems
- Scale-Free Networks are Ultrasmall
- Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
- The statistical mechanics of networks
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Cut-offs and finite size effects in scale-free networks
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Construction and properties of assortative random networks
- The entropy of randomized network ensembles
- Quantifying randomness in real networks
- Efficient and exact sampling of simple graphs with given arbitrary degree sequence
- All scale-free networks are sparse
- Performance of networks of artificial neurons: The role of clustering
- Transport on Complex Networks: Flow, Jamming and Optimization
- Empirical analysis of web-based user-object bipartite networks
- Uncovering disassortativity in large scale-free networks
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Relations between Average Distance, Heterogeneity and Network Synchronizability
- Structural constraints in complex networks
- Clustering Drives Assortativity and Community Structure in Ensembles of Networks
- Zero Pearson Coefficient for Strongly Correlated Growing Trees
- 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
- Measuring degree-degree association in networks
- Fundamental Structural Constraint of Random Scale-Free Networks
Cited by in corpus (8)
- Network constraints on the mixing patterns of binary node metadata
- Misinformation spreading on correlated multiplex networks
- Assortative Mixing in Weighted Directed Networks
- Bounds of memory strength for power-law series
- 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