Abstract

In this paper we study a random graph with N nodes, where node j has degree Dj and {Dj} N j=1 are i.i.d. with P(Dj ≤ x) = F(x). We assume that 1 − F(x) ≤ cx −τ+1 for some τ> 3 and some constant c> 0. This graph model is a variant of the so-called configuration model, and includes heavy tail degrees with finite variance. The minimal number of edges between two arbitrary connected nodes, also known as the graph distance or the hopcount, is investigated when N → ∞. We prove that the graph distance grows like log ν N, when the base of the logarithm equals ν = E[Dj(Dj − 1)]/E[Dj]> 1. This confirms the heuristic argument of Newman, Strogatz and Watts [35]. In addition, the random fluctuations around this asymptotic mean log ν N are characterized and shown to be uniformly bounded. In particular, we show convergence in distribution of the centered graph distance along exponentially growing subsequences. 1

Citations