%0 Generic %1 Melnik2016Simple %A Melnik, Sergey %A Gleeson, James P. %D 2016 %K path\_length, preprint correlations configuration-model %T Simple and accurate analytical calculation of shortest path lengths %U http://arxiv.org/abs/1604.05521 %X We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks. We obtain very accurate results for synthetic random networks with specified degree distribution (the so-called configuration model networks). Our method allows us to accurately predict the distribution of shortest path lengths on real-world networks using their degree distribution, or joint degree-degree distribution. Compared to some other methods, our approach is simpler and yields more accurate results. In order to obtain the analytical results, we use the analogy between an infection reaching a node in \$n\$ discrete time steps (i.e., as in the susceptible-infected epidemic model) and that node being at a distance \$n\$ from the source of the infection.

@misc{Melnik2016Simple, abstract = {{We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks. We obtain very accurate results for synthetic random networks with specified degree distribution (the so-called configuration model networks). Our method allows us to accurately predict the distribution of shortest path lengths on real-world networks using their degree distribution, or joint degree-degree distribution. Compared to some other methods, our approach is simpler and yields more accurate results. In order to obtain the analytical results, we use the analogy between an infection reaching a node in \$n\$ discrete time steps (i.e., as in the susceptible-infected epidemic model) and that node being at a distance \$n\$ from the source of the infection.}}, added-at = {2019-06-10T14:53:09.000+0200}, archiveprefix = {arXiv}, author = {Melnik, Sergey and Gleeson, James P.}, biburl = {https://www.bibsonomy.org/bibtex/2085471ba87d13fe26d21787fb44202d8/nonancourt}, citeulike-article-id = {14020013}, citeulike-linkout-0 = {http://arxiv.org/abs/1604.05521}, citeulike-linkout-1 = {http://arxiv.org/pdf/1604.05521}, day = 19, eprint = {1604.05521}, interhash = {e2f638ce6eb70d2e4d5cc262c268a2b0}, intrahash = {085471ba87d13fe26d21787fb44202d8}, keywords = {path\_length, preprint correlations configuration-model}, month = apr, posted-at = {2016-04-23 11:30:48}, priority = {2}, timestamp = {2019-08-22T16:26:42.000+0200}, title = {{Simple and accurate analytical calculation of shortest path lengths}}, url = {http://arxiv.org/abs/1604.05521}, year = 2016 }