Phase transitions for scaling of structural correlations in directed networks
arXiv:1504.01535 · doi:10.1103/PhysRevE.92.022803
Abstract
Analysis of degree-degree dependencies in complex networks, and their impact on processes on networks requires null models, i.e. models that generate uncorrelated scale-free networks. Most models to date however show structural negative dependencies, caused by finite size effects. We analyze the behavior of these structural negative degree-degree dependencies, using rank based correlation measures, in the directed Erased Configuration Model. We obtain expressions for the scaling as a function of the exponents of the distributions. Moreover, we show that this scaling undergoes a phase transition, where one region exhibits scaling related to the natural cut-off of the network while another region has scaling similar to the structural cut-off for uncorrelated networks. By establishing the speed of convergence of these structural dependencies we are able to asses statistical significance of degree-degree dependencies on finite complex networks when compared to networks generated by the directed Erased Configuration Model.
References in corpus (20)
- Power-law distributions in empirical data
- Assortative mixing in networks
- Random graphs with arbitrary degree distributions and their applications
- Evolution of networks
- Specificity and stability in topology of protein networks
- Generation of uncorrelated random scale-free networks
- Epidemic spreading in correlated complex networks
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Cut-offs and finite size effects in scale-free networks
- Resilience to damage of graphs with degree correlations
- Edge direction and the structure of networks
- The origin of degree correlations in the Internet and other networks
- Analytical maximum-likelihood method to detect patterns in real networks
- Efficient and exact sampling of simple graphs with given arbitrary degree sequence
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Uncovering disassortativity in large scale-free networks
- Distances in random graphs with finite variance degrees
- Zero Pearson Coefficient for Strongly Correlated Growing Trees
- Constructing and sampling directed graphs with given degree sequences