Network rewiring in the $r$-$K$ plane

Abstract

We generate correlated scale-free networks in the configuration model through a new rewiring algorithm which allows to tune the Newman assortativity coefficient $r$ and the average degree of the nearest neighbors $K$ (in the range $-1\le r\le 1$, $K\ge ⟨k⟩$). At each attempted rewiring step, local variations $\Delta r$ and $\Delta K$ are computed and then the step is accepted according to a standard Metropolis probability $\exp (\pm \Delta r/T)$, where $T$ is a variable temperature. We prove a general relation between $\Delta r$ and $\Delta K$, thus finding a connection between two variables which have very different definitions and topological meaning. We describe rewiring trajectories in the $r$-$K$ plane and explore the limits of maximally assortative and disassortative networks, including the case of small minimum degree ($k_{min}\ge 1$) which has previously not been considered. The size of the giant component and the entropy of the network are monitored in the rewiring. The average number of second neighbours in the branching approximation ${\bar{z}}_{2,B}$ is proven to be constant in the rewiring, and independent from the correlations for Markovian networks. As a function of the degree, however, the number of second neighbors gives useful information on the network connectivity and is also monitored.

21 pages, 7 figures

References in corpus (16)

• Assortative mixing in networks
• Epidemic processes in complex networks
• Evolution of networks
• Mixing patterns in networks
• Theory of Rumour Spreading in Complex Social Networks
• The Statistical Physics of Real-World Networks
• Epidemic spreading in complex networks with degree correlations
• Construction and properties of assortative random networks
• The entropic origin of disassortativity in complex networks
• Robustness and Assortativity for Diffusion-like Processes in Scale-free Networks
• Disease Spreading in Structured Scale-Free Networks
• Computational complexity arising from degree correlations in networks
• The configuration model for Barabasi-Albert networks
• Spectral properties and the accuracy of mean-field approaches for epidemics on correlated networks
• The Bass diffusion model on networks with correlations and inhomogeneous advertising
• Higher order assortativity in complex networks

Cited by in corpus (4)

• The Bass diffusion model: agent-based implementation on arbitrary networks
• Generation of scale-free assortative networks via Newman rewiring for simulation of diffusion phenomena
• Diffusion on assortative networks: from mean-field to agent-based, via Newman rewiring
• Diagonal degree correlations vs. epidemic threshold in scale-free networks