title: Distance distribution in configuration-model networks.
abstract: 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.
authors.affiliation: Racah Institute of Physics, The Hebrew University, Jerusalem 91904, Israel.|Department of Microbiology and Molecular Genetics, Faculty of Medicine, The Hebrew University, Jerusalem 91120, Israel.
authors.forename: Mor
authors.initials: M
authors.lastname: Nitzan
authors.affiliation: Racah Institute of Physics, The Hebrew University, Jerusalem 91904, Israel.
authors.forename: Eytan
authors.initials: E
authors.lastname: Katzav
authors.affiliation: Department of Mathematics, King's College London, Strand, London WC2R 2LS, United Kingdom.
authors.forename: Reimer
authors.initials: R
authors.lastname: Kühn
authors.affiliation: Racah Institute of Physics, The Hebrew University, Jerusalem 91904, Israel.
authors.forename: Ofer
authors.initials: O
authors.lastname: Biham