The origin of degree correlations in the Internet and other networks

TL;DR

This paper investigates the origin of degree correlations in the Internet, proposing a formalism for graph ensembles with single edges and analyzing how such restrictions influence observed degree anticorrelations.

Contribution

It introduces a formal model for graphs with single edges and derives correlation measures, confirming that edge restrictions partly explain Internet degree correlations.

Findings

Edge restrictions contribute to degree anticorrelations.

The model reproduces some observed Internet correlation patterns.

Not all measured correlations are explained by the model.

Abstract

It has been argued that the observed anticorrelation between the degrees of adjacent vertices in the network representation of the Internet has its origin in the restriction that no two vertices have more than one edge connecting them. Here we introduce a formalism for modeling ensembles of graphs with single edges only and derive values for the exponents and correlation coefficients characterizing them. Our results confirm that the conjectured mechanism does indeed give rise to correlations of the kind seen in the Internet, although only a part of the measured correlation can be accounted for in this way.