Degree correlations in directed scale-free networks
arXiv:1409.4970 · doi:10.1371/journal.pone.0110121
Abstract
Scale-free networks, in which the distribution of the degrees obeys a power-law, are ubiquitous in the study of complex systems. One basic network property that relates to the structure of the links found is the degree assortativity, which is a measure of the correlation between the degrees of the nodes at the end of the links. Degree correlations are known to affect both the structure of a network and the dynamics of the processes supported thereon, including the resilience to damage, the spread of information and epidemics, and the efficiency of defence mechanisms. Nonetheless, while many studies focus on undirected scale-free networks, the interactions in real-world systems often have a directionality. Here, we investigate the dependence of the degree correlations on the power-law exponents in directed scale-free networks. To perform our study, we consider the problem of building directed networks with a prescribed degree distribution, providing a method for proper generation of power-law-distributed directed degree sequences. Applying this new method, we perform extensive numerical simulations, generating ensembles of directed scale-free networks with exponents between~2 and~3, and measuring ensemble averages of the Pearson correlation coefficients. Our results show that scale-free networks are on average uncorrelated across directed links for three of the four possible degree-degree correlations, namely in-degree to in-degree, in-degree to out-degree, and out-degree to out-degree. However, they exhibit anticorrelation between the number of outgoing connections and the number of incoming ones. The findings are consistent with an entropic origin for the observed disassortativity in biological and technological networks.
10 pages, 5 figures
References in corpus (33)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Lethality and centrality in protein networks
- Assortative mixing in networks
- The structure of scientific collaboration networks
- The diameter of the world wide web
- The large-scale organization of metabolic networks
- Mixing patterns in networks
- The structure and dynamics of multilayer networks
- Classes of behavior of small-world networks
- Specificity and stability in topology of protein networks
- How Popular is Your Paper? An Empirical Study of the Citation Distribution
- The Web of Human Sexual Contacts
- Generation of uncorrelated random scale-free networks
- Large-scale topological and dynamical properties of Internet
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Cut-offs and finite size effects in scale-free networks
- 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
- All scale-free networks are sparse
- The entropic origin of disassortativity in complex networks
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Uncovering disassortativity in large scale-free networks
- Robustness and Assortativity for Diffusion-like Processes in Scale-free Networks
- Emergence of assortative mixing between clusters of cultured neurons
- Constructing and sampling directed graphs with given degree sequences
- Network Reliability: The effect of local network structure on diffusive processes
- Endemic infections are always possible on regular networks
- Critical Boolean networks with scale-free in-degree distribution
- Scaling laws in critical random Boolean networks with general in- and out-degree distributions
- Degree-degree dependencies in directed networks with heavy-tailed degrees
Cited by in corpus (13)
- Synchronization in networks with multiple interaction layers
- Visibility of minorities in social networks
- Authorship Attribution Based on Life-Like Network Automata
- Fast and accurate determination of modularity and its effect size
- Exact sampling of graphs with prescribed degree correlations
- Finding network communities using modularity density
- Revealing the Micro-Structure of the Giant Component in Random Graph Ensembles
- Concurrence of form and function in developing networks and its role in synaptic pruning
- Dense networks with scale-free feature
- Lower bound of assortativity coefficient in scale-free networks
- Mechanisms for tuning clustering and degree-correlations in directed networks
- Generating random networks that consist of a single connected component with a given degree distribution
- Mathematical Models for Predicting and Mitigating the Spread of Chlamydia Sexually Transmitted Infection