The mean and variance of the distribution of shortest path lengths of random regular graphs

Abstract

Abstract The distribution of shortest path lengths (DSPL) of random networks provides useful information on their large scale structure. In the special case of random regular graphs (RRGs), which consist of N nodes of degree c ⩾ 3, the DSPL, denoted by P(L = ℓ), follows a discrete Gompertz distribution. Using the discrete Laplace transform we derive a closed-form (CF) expression for the moment generating function of the DSPL of RRGs. From the moment generating function we obtain CF expressions for the mean and variance of the DSPL. More specifically, we find that the mean distance between pairs of distinct nodes is given by ⟨ L ⟩ = ln N ln ( c − 1 ) + 1 2 − ln c − ln ( c − 2 ) + γ ln ( c − 1 ) + O ln N N , where γ is the Euler–Mascheroni constant. While the leading term is known, this result includes a novel correction term, which yields very good agreement with the results obtained from direct numerical evaluation of ⟨L⟩ via the tail-sum formula and with the results obtained from computer simulations. However, it does not account for an oscillatory behavior of ⟨L⟩ as a function of c or N. These oscillations are negligible in sparse networks but detectable in dense networks. We also derive an expression for the variance Var(L) of the DSPL, which captures the overall dependence of the variance on c but does not account for the oscillations. The oscillations are due to the discrete nature of the shell structure around a random node. They reflect the profile of the filling of new shells as N is increased. The results for the mean and variance are compared to the corresponding results obtained in other types of random networks. The relation between the mean distance and the diameter is discussed.