Assortative mixing by degree makes a network more unstable

Abstract

We investigate the role of degree correlation among nodes on the stability of complex networks, by studying spectral properties of randomly weighted matrices constructed from directed Erdös-Rényi and scale-free random graph models. We focus on the behaviour of the largest real part of the eigenvalues, ${\lambda }_{\text{max}}$, that governs the growth rate of perturbations about an equilibrium (and hence, determines stability). We find that assortative mixing by degree, where nodes with many links connect preferentially to other nodes with many links, reduces the stability of networks. In particular, for sparse scale-free networks with $N$ nodes, ${\lambda }_{\text{max}}$ scales as $N^{\alpha }$ for highly assortative networks, while for disassortative graphs, ${\lambda }_{\text{max}}$ scales logarithmically with $N$. This difference may be a possible reason for the prevalence of disassortative networks in nature.

4 pages, 4 figures

Cited by in corpus (8)

• Characterization of complex networks: A survey of measurements
• Enhancing neural-network performance via assortativity
• Topological features of proteins from amino acid residue networks
• Hypergraph assortativity: a dynamical systems perspective
• Community structures in allelopathic interaction networks: an eco-evolutionary approach
• Link-Space and Network Analysis
• Interplay between Network Topology and Dynamics in Neural Systems
• Stability as a natural selection mechanism on interacting networks