Distance distribution in configuration-model networks.

We present analytical results for the distribution of shortest path lengths between random pairs of nodes in configuration model networks. The results, which are based on recursion equations, are shown to be in good agreement with numerical simulations for networks with degenerate, binomial, and power-law degree distributions. The mean, mode, and variance of the distribution of shortest path lengths are also evaluated. These results provide expressions for central measures and dispersion measures of the distribution of shortest path lengths in terms of moments of the degree distribution, illuminating the connection between the two distributions.

[1]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[2]  Raissa M. D'Souza,et al.  Complex networks: Structure comes to random graphs , 2009 .

[3]  Ernesto Estrada,et al.  The Structure of Complex Networks: Theory and Applications , 2011 .

[4]  James S. Harris,et al.  Tables of integrals , 1998 .

[5]  Guido Caldarelli,et al.  Scale-Free Networks , 2007 .

[6]  N. Wormald.  Models of random regular graphs , 2010 .

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  V. Akila,et al.  Information , 2001, The Lancet.

[9]  Béla Bollobás,et al.  Random Graphs , 1985 .

[10]  46 , 2015, Slow Burn.

[11]  Mark Newman,et al.  Networks: An Introduction , 2010 .