A general formulation of long-range degree correlations in complex networks
arXiv:1712.00910 · doi:10.1103/PhysRevE.97.062308
Abstract
We provide a general framework for analyzing degree correlations between nodes separated by more than one step (i.e., beyond nearest neighbors) in complex networks. One probability and four conditional probabilities are introduced to fully describe long-range degree correlations with respect to and of two nodes and shortest path length between them. We present general relations among these probabilities and clarify the relevance to nearest-neighbor degree correlations. Unlike nearest-neighbor correlations, some of these probabilities are meaningful only in finite-size networks. Furthermore, as a baseline to determine the existence or nonexistence of long-range degree correlations in a network, the functional forms of these probabilities for networks without any long-range degree correlations are analytically evaluated within a mean-field approximation. The validity of our argument is demonstrated by applying it to real-world networks.
arXiv comment9 pages, 4 figures
References in corpus (36)
- Emergence of scaling in random networks
- Assortative mixing in networks
- Random graphs with arbitrary degree distributions and their applications
- Mixing patterns in networks
- Specificity and stability in topology of protein networks
- Dynamical and correlation properties of the Internet
- Mitigation of Malicious Attacks on Networks
- Epidemic dynamics on an adaptive network
- Origins of fractality in the growth of complex networks
- Epidemic spreading in correlated complex networks
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- Epidemic threshold in structured scale-free networks
- Nature of the epidemic threshold for the susceptible-infected-susceptible dynamics in networks
- Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations
- Construction and properties of assortative random networks
- The origin of degree correlations in the Internet and other networks
- Fractal and Transfractal Recursive Scale-Free Nets
- Quantifying randomness in real networks
- Percolation on correlated networks
- Tuning clustering in random networks with arbitrary degree distributions
- Assortative model for social networks
- Correlations in weighted networks
- Robustness of onion-like correlated networks against targeted attacks
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Uncovering disassortativity in large scale-free networks
- Synchronization in weighed scale-free networks with degree-degree correlation
- Self-similar Scale-free Networks and Disassortativity
- Percolation transition in networks with degree-degree correlation
- Degree Correlation in Scale-Free Graphs
- Local clustering in scale-free networks with hidden variables
- Higher order assortativity in complex networks
- Epidemic Extinction Paths in Complex Networks
- Quantifying long-range correlations in complex networks beyond nearest neighbors
- Fractality and degree correlations in scale-free networks
- Synchronization in Scale Free networks with degree correlation
- Resilience of antagonistic networks with regard to the effects of initial failures and degree-degree correlations
Cited by in corpus (9)
- Information theoretic network approach to socioeconomic correlations
- Structure of percolating clusters in random clustered networks
- Degree correlations in graphs with clique clustering
- Emergence of Long-Range Correlations in Random Networks
- Analytic solution of the two-star model with correlated degrees
- Identification of intrinsic long-range degree correlations in complex networks
- Percolation on a maximally disassortative network
- Bifractality of fractal scale-free networks
- Revisiting finite size effect of percolation in degree correlated networks