Analytical results for the distribution of shortest path lengths in random networks
Analytical results for the distribution of shortest path lengths in random networks
We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-R\'enyi networks, based on recursion equations for the shells around a reference node and for the paths originating from it. The results are in agreement with numerical simulations for a broad range of network sizes …