Random degree-degree correlated networks

Abstract

Correlations may affect propagation processes on complex networks. To analyze their effect, it is useful to build ensembles of networks constrained to have a given value of a structural measure, such as the degree-degree correlation $r$, being random in other aspects and preserving the degree distribution. This can be done through Monte Carlo optimization procedures. Meanwhile, when tuning $r$, other network properties may concomitantly change. Then, in this work we analyze, for the $r$-ensembles, the impact of $r$ on properties such as transitivity, branching and characteristic lengths, that are relevant when investigating spreading phenomena on these networks. The present analysis is performed for networks with degree distributions of two main types: either localized around a typical degree (with exponentially bounded asymptotic decay) or broadly distributed (with power-law decay). Correlation bounds and size effects are also investigated.

8 pages, 9 figures

References in corpus (6)

• Clustering in complex networks. I. General formalism
• Scaling of degree correlations and the influence on diffusion in scale-free networks
• Percolation transition in networks with degree-degree correlation
• Spreading dynamics on small-world networks with connectivity fluctuations and correlations
• Generating random networks with given degree-degree correlations and degree-dependent clustering
• Optimizing transport efficiency on scale-free networks through assortative or dissortative topology